Problem D
March of the Penguins

Somewhere near the south pole, a number of penguins are standing on a number of ice floes. Being social animals, the penguins would like to get together, all on the same floe. The penguins do not want to get wet, so they have use their limited jump distance to get together by jumping from piece to piece. However, temperatures have been high lately, and the floes are showing cracks, and they get damaged further by the force needed to jump to another floe. Fortunately the penguins are real experts on cracking ice floes, and know exactly how many times a penguin can jump off each floe before it disintegrates and disappears. Landing on an ice floe does not damage it. You have to help the penguins find all floes where they can meet.

Figure 1: Illustration of the first sample input, $5$ ice floes with $3$ penguins on them.

Input

Input contains a single test case, consisting of:

• One line with the integer $N$ ($1 \le N \le 100$) and a real number $D$ ($0 \le D \le 100\, 000$, at most $2$ decimals after the decimal point), denoting the number of ice pieces and the maximum distance a penguin can jump.

• $N$ lines, each line containing four integers $x_ i$, $y_ i$, $n_ i$ and $m_ i$, denoting for each ice piece its $X$ and $Y$ coordinate, the number of penguins on it and the maximum number of times a penguin can jump off this piece before it disappears ($-10\, 000 \le x_ i, y_ i \le 10\, 000$, $0 \le n_ i \le 10$, $1 \le m_ i \le 200$).

Output

• One line containing a space-separated list of $0$-based indices of the pieces on which all penguins can meet. If no such piece exists, output a line with the single number $-1$.

5 3.5
1 1 1 1
2 3 0 1
3 5 1 1
5 1 1 1
5 4 0 1

1 2 4

3 1.1
-1 0 5 10
0 0 3 9
2 0 1 1

-1