|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||59||31||27||50.000%|
Suppose 4 teachers are grading the presentation of a student and all their given marks are integers. The actual score is computed by taking arithmetic average of these 4 marks. Even though the marks are integers, the average can still be a fraction. But in some cases the average can also be an integer and in some rare cases the one of given marks can be equal to the average. Such rare incidents are called matching events. Considering all possible marks given by all teachers, you will have to count the total number of matching events. If the average mark matches with marks given by more than 1 teacher then for each match a matching event should be counted.
There are at most 1001 test cases. The description of each test case is given below:
The input for each test case consists of two integers N (2 ≤ N ≤ 60) and fullmarks (1 ≤ fullmarks ≤ 200). Here N denotes the number of teachers who are grading the student and fullmarks denotes the maximum possible mark that any of the teachers can give. The minimum mark that a teacher can give is always zero.
Input is terminated by a line containing two zeroes.
For each test case produce one line of output. This line contains the value M % 1 000 000 007 where M is the total number of matching events for the given input.
4 100 3 1 0 0