|시간 제한||메모리 제한||제출||정답||맞힌 사람||정답 비율|
|2 초||512 MB||59||25||24||50.000%|
Nick is going to take an important test soon, so he has decided to prepare. Test has n possible variants, the i-th of them has mi tasks numbered from 1 to mi. For each task of each variant Nick has estimated the time tij minutes that it would take him to solve it and write down.
The tasks in the test must be solved in order they appear in the test, one after another. The test must be submitted until deadline of t minutes. Nick thinks he could secretly copy some solutions from his notes, but he doesn't want to risk much. So he would copy at most one solution. Copying of any solution would take t0 minutes.
Now Nick would like to find out for each variant what is the maximal number of tasks he could write down if he gets this variant.
The first line of input contains three integers: n, t and t0 (1 ≤ n ≤ 100, 1 ≤ t ≤ 10 000, 1 ≤ t0 ≤ 100) — the number of variants, the length of the test, and the time needed to secretly copy the solution from the notes.
The following n lines describe variants. The first integer mi (1 ≤ mi ≤ 100) is the number of tasks in the i-th variant. It is followed by mi integers tij (1 ≤ tij ≤ 100) — time needed for tasks.
For each variant print one integer: the number of tasks Nick can write down if he gets this variant.
4 45 5 5 10 10 10 10 10 4 30 10 10 10 3 40 40 5 1 100
5 4 2 1
Contest > Russian Code Cup > 2016 > RCC 2016 Elimination Round A번