Matches

Input

The first line of input contains the integers $n$, $k$, and $m$ (0 < k < n < 25, 0 \le m \le 50). Each of the next $n$ lines contains a description of a match: four integers x_{i,1}, y_{i,1}, x_{i,2}, y_{i,2}, representing the coordinates of the endpoints of the $i$-th match.

Each match has length $1$. No two matches overlap. The absolute values of all coordinates do not exceed $100$.

Output

If it is impossible to obtain exactly $m$ squares, output the single number $-1$. Otherwise, output $k$ numbers: the indices of the matches to remove. Matches are numbered starting from $1$. If there are multiple solutions, output any one of them.

Examples