Since he was a child, Juan's dream has always been to fly, to go beyond the sky, to reach the stars. Due to the physical limitations of his human condition, he decides to get to work to build a flying car that will make his dreams come true.
After a long time studying the necessary engineering, and after many failed attempts, Juan has almost managed to build the vehicle: he just needs the engine, the steering wheel, and the spare tire (he also doesn't have brakes, but his optimism tells him that he won't need them). Many stores around have the three pieces he needs, but for convenience, he decides that he will only go to one store, the one that is the cheapest in total.
Can you help him decide which store he should go to?
The input starts with an integer $$$T$$$, the number of test cases. Each case begins with $$$n$$$, the number of stores. It is followed by $$$n$$$ lines, each containing 3 integers $$$a_{i}$$$, $$$b_{i}$$$, $$$c_{i}$$$, indicating the prices of the engine, the steering wheel, and the spare tire respectively at the $$$i$$$-th store.
For each case, print a line with the number of the store Juan should go to. The stores are numbered from $$$1$$$ to $$$n$$$ according to their order of appearance in the input. In case of a tie, choose the store with the lowest number.
$$$1 \leq n \leq 10^6$$$, $$$1 \leq a_i,b_i,c_i \leq 10^8$$$
It is guaranteed that the sum of the $$$n$$$ in all cases does not exceed $$$10^7$$$.
3 2 7 1 3 5 2 1 3 9 8 2 10 14 1 1 8 11 4 23 42 13 7 12 38 10 9 24 8 10 10
2 1 4
