Leaderboard
Showing:
Handle Score
@Ibrahim Nash 5725
@blackshadows 5685
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Complete Leaderboard
Rahul and The Lift
Medium Accuracy: 24.01% Submissions: 344 Points: 4

Rahul entered lift on the ground floor of his building which consists of Z floors including the ground floor.
The lift already had N people in it. It is known that they will leave the lift in groups. Let us say that
there are M groups. Rahul is curious to find the number of ways in which these M groups can leave the lift.
It is assumed that each group is unique and no one leaves the lift on the ground floor.

Since the answer can be too large take modulo 1000000007

Input:

The first line of input constists of the number of testcase T. Next T lines consists of three integers Z , N , M


Output:

Output consists of T lines each indicating the answer for each test case.


Constraints:

1 <= T <= 10000
1 <= M <= 100000
1 <= Z <= 100000
1 <= N <= 100000


Example:

Sample Input :

1
3 10 2

Sample Output :

6

Explanation :

Let the groups are A and B.

1. Both A and B gets down on first floor A going first followed by B
2. Both A and B gets down on first floor B going first followed by A
3. Both A and B gets down on second floor A going first followed by B
4. Both A and B gets down on second floor B going first followed by A
5. A gets down of first floor and B gets down on second.
6. B gets down of first floor and A gets down on second.

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Rahul and The Lift

Output Window