|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||5||2||2||40.000%|
The School of Food Sciences is running an experiment to study the effect of a healthy diet on the behaviour of monkeys. Each day the monkeys are separated into G groups. Each group has one or more monkeys and each group is given a single daily serving of fruits and vegetables according to the following rules:
The project has a daily budget to purchase B fruits and vegetables, which must be completely spent, and B < 100*M. All fruits and vegetables have the same price. All purchased fruits and vegetables must be fed to the monkeys.
For 2 groups, of 3 and 4 monkeys, there are 6 different ways to feed them on a budget of 5 with the condition that each group may have no more than 5 fruits plus vegetables.
Your task, as the IT member, is to write a program to compute the number of different ways to feed the monkeys.
The input starts with an integer C, on a line by itself, that represents the number of test cases. 1 < C < 100. Each test case consists of three integers B, G and M on a line by themselves. B is the budget of the day, G is the number of groups, and M is the maximum number of fruits plus vegetables that any group may receive. 1 < B < 10,000,000, and 1 < G, M < 100,000.
For each test case, print the number of different ways to feed the monkeys as an integer, modulo the prime number 1000,000,007.
3 5 2 5 5 2 3 4 1 5
6 2 1