Gennady is one of the best child dentists in Berland. Today n children got an appointment with him, they lined up in front of his office. All children love to cry loudly at the reception at the dentist. We enumerate the children with integers from 1 to n in the order they go in the line. Every child is associated with the value of his cofidence p i . The children take turns one after another to come into the office; each time the child that is the first in the line goes to the doctor. While Gennady treats the teeth of the i -th child, the child is crying with the volume of v i . At that the confidence of the first child in the line is reduced by the amount of v i , the second one — by value v i - 1 , and so on. The children in the queue after the v i -th child almost do not hear the crying, so their confidence remains unchanged. If at any point in time the confidence of the j -th child is less than zero, he begins to cry with the volume of d j and leaves the line, running towards the exit, without going to the doctor's office. At this the confidence of all the children after the j -th one in the line is reduced by the amount of d j . All these events occur immediately one after the other in some order. Some cries may lead to other cries, causing a chain reaction. Once in the hallway it is quiet, the child, who is first in the line, goes into the doctor's office. Help Gennady the Dentist to determine the numbers of kids, whose teeth he will cure. Print their numbers in the chronological order. The first line of the input contains a positive integer n ( 1 ≤ n ≤ 4000 ) — the number of kids in the line. Next n lines contain three integers each v i , d i , p i ( 1 ≤ v i , d i , p i ≤ 10 6 ) — the volume of the cry in the doctor's office, the volume of the cry in the hall and the confidence of the i -th child. In the first line print number k — the number of children whose teeth Gennady will cure. In the second line print k integers — the numbers of the children