Taco Productivity Contest

In the Taco Productivity Contest, each employee's performance over several days is recorded. An employee is considered a winner if there exists at least one sequence of K consecutive days during which their productivity is strictly increasing. Formally, given an employee's productivity data \(a_1, a_2, \ldots, a_D\), the employee qualifies if there exists an index \(i\) such that \(a_i < a_{i+1} < \ldots < a_{i+K-1}\). All indices are 0-indexed. Your task is to identify the indices of the employees who meet this criterion.

Input constraints: The number of employees, the number of days, and the minimum consecutive days \(K\) are provided, followed by the productivity data for each employee.

Note: Ensure your solution reads from standard input (stdin) and writes to standard output (stdout).

inputFormat

The first line contains three integers: num_employees, num_days, and K, separated by spaces.

Then follow num_employees lines, each containing num_days integers separated by spaces. Each line represents the productivity values for one employee over the num_days days.

outputFormat

Output a single line containing the indices (0-indexed) of the employees who have at least one sequence of K consecutive days with strictly increasing productivity. The indices should be separated by a single space. If no employee qualifies, output an empty line.

4 6 3
1 2 3 4 3 2
3 4 5 6 7 8
1 1 1 1 1 1
5 1 2 3 4 5

0 1 3