Question
Healthy Kael
Kael has M candies he wants to eat swiftly, but to stay healthy, he sets daily limits on how many he can consume. Each day from day 1 to 7 has a unique limit b1, b2, ..., b7. Determine the day, starting from day 1, when Kael eats the last candy.
Input
The first line of the input contains a single integer M.
The next line of the input contains 7 space-separated integers.
The next line of the input contains 7 space-separated integers.
Output
Print the day on which Kael will eat the last chocolate.
Note: Day 1 refers to Monday.
Note: Day 1 refers to Monday.
Example
Sample Input
15
2 4 3 1 0 0 1
Sample Output
Tuesday
Explanation
Kael ate 11 candies in the first week. Then next 2 candies on Monday, and last 2 candies on Tuesday.
15
2 4 3 1 0 0 1
Sample Output
Tuesday
Explanation
Kael ate 11 candies in the first week. Then next 2 candies on Monday, and last 2 candies on Tuesday.