394. Berhatton
Time limit per test: 1.5
second(s)
Memory limit: 65536
kilobytes
input: standard
output: standard
Berhatton is one of the most picturesque districts of Berland. All streets in Berhatton are parallel to the coordinate axes. All streets are really long, so you can consider them infinite. Any point with integer coordinates is an intersection of two streets. So the whole plane is divided by streets into oneunit squares. All squares are occupied by the skyscrappers. Due to this fact, the distance between point (
x_{1},
y_{1}) and point (
x_{2},
y_{2}) is equal to x
_{1} 
x_{2} + y
_{1} 
y_{2}. BerPizza company has been working in Berhatton for a while and has
N pizza huts. In each pizza hut they can make any kind of pizza from the menu and deliver it to the customer. Unfortunately, the company doesn't have enough funds to buy cars or even bikes for pizza delivery, so pizza boys have to deliver pizza on foot. Pizza boys from different huts run with the different speed. Everybody knows the famous motto of BerPizza "Deliver pizza in 10 minutes", so pizza boys have to move fast.
Nowadays BerPizza company has a hard time, because hamburgers become more and more popular. BerPizza has even decided to close some of their huts because of financial problems. BerPizza president has made a rush decision that the pizza hut
A can be closed if pizza boys from at least
K other pizza huts can reach it in 10 minutes. Your task is to find numbers of pizza huts, which can be closed.
Input
The first line of the input contains two integer numbers
N and
K (2 ≤
N ≤ 10
^{5}, 1 ≤
K ≤
N  1). The following
N lines contain coordinates of pizza huts
x,
y, and number
w — the amount of unit segments pizza boy can cover in 10 minutes (0 ≤
x ≤ 10
^{9}, 0 ≤
y ≤ 10
^{9}, 1 ≤
w ≤ 10
^{9}).
Output
Print the number of pizza huts
T which can be closed to the first line of the output file. The next line should contain
T numbers — the numbers of pizza huts that need to be closed. Pizza hut numbers should be printed in increasing order. Pizza huts are numbered from 1 to
N in the order they are given in the input file.
Example(s)
sample input

sample output

2 1
0 0 1
1 0 1

2
1 2

sample input

sample output

3 2
0 0 1
1 0 1
10 3 1

0

sample input

sample output

3 2
0 0 100
13 17 5
10 10 10

1
2
