Time Limit:1000ms Memory Limit:65536KB

Description

One day, Huang Yaoshi, Zhou Botong and Li Qiushui meet in SCU again.
No contact for so many years, they all have a great progress in Kung Fu,
and still can not differentiate who is the best in the world.
So they ask the famous Lord Windy to decide.
But in fact, it is also difficut for Lord Windy to know who is the best
in the three young man in Kung Fu, so he make an ACM problem to 
differentiate who is clever for them, and the one who first solve it 
is the best in the world.

The problem is thisú║

This year there are K students to participate in ACM competition.
After the competion,
every one of the K participants can get a rank between 1 and K,
and there are no two students whose ranks are the same.
To enable all the K students to have a harvest,
the organizers decide to distribute apples to the K participants.
At first the organizers buy N apples which are the same,
and then distribute the N apples with the rules of thisú║

(1) The number of apples each student gets can not be more than L.
(2) The number of apples each student gets can not be zero.
(3) At last there is no apple left.

Now give the N, K, L, you just tell me after the competition,
how many different ways to distribute the N apples to the K participants.
Because the result may be very large,
we make the result module 1024 for the output.

Huang Yaoshi, Zhou Botong ahd Li Qiushui can not solve the problem,
they ask you to help them.

Input

Mutiple test cases.
For each test case:
There is only one line with three integers seperated by a space: N, K and L.

1 <= N <= 64
1 <= K <= 64
1 <= L <= 64
(2*(L-1)>N-K)

Output

For each test case output the answer in a single line.

Sample Input

6 37 10
34 18 28
49 46 56
49 46 3
28 13 9
14 4 8

Sample Output

0
166
912
866
768
246

Hint

Huge input, C-style IO functioin (scanf & printf) recommended.
The number of test cases can be 250,000, so dp algorithm for each test case will get TLE.

Author

baihacker

Source