405221: GYM101848 E Balance Reset

You are graduating from your school. There are still some money on your student card, and you don't want to waste even one dollar.

The only way to reset your balance, is to eat lunch, at the school canteen. The canteen offers 2n kinds of meals, selling a₁, a₂, ..., a_2n dollars respectively. Every day, the canteen randomly pick n kinds of meals that will be selling today. In other words, the other half will NOT be on "today's menu". When you recharge your student card, only multiples of 100 is acceptable.

Your balance now is p dollars.

You can always recharge your student card every day. And after the recharging, you will decide to eat at the canteen or not. If yes, you have to pick one of those n kinds of meals. The target is to make the balance on your student card become 0 in 365 days.

The dataset guarantees that this is possible.

You will first read two space-separated integers n and p (1 ≤ n ≤ 500, 1 ≤ p ≤ 100).

The second line contains 2n space-separated integers a₁, a₂, ..., a_2n (1 ≤ a_i ≤ 100). They are the prices of the meals.

Then for every day, you will read n space-separated integers i₁, i₂, ..., i_n from the interactor, denoting which n meals are sold today. The prices are, of course, a_i1, a_i2, ..., a_in. The interactor guarantees that its choices are completely random. There will not be strategies against you.

You will respond in the following way: output two space-separated integers c and s (0 ≤ c ≤ 100, s = 0 or ). c is the number of 100 dollars, that is 100·c dollars you are going to recharging with. s is your choice. If you decide not to eat at the canteen, s = 0.

If when the day is over, your balance is already 0. Please exit your program immediately. Exiting too early or too late will not pass the test.

2 5
2 3 3 3
1 2
2 3

0 1
0 2