Compute nCr % p
Submissions: 519   Accuracy:

22.05%

  Difficulty: Easy   Marks: 2

Given 2 number n and r, compute nCr mod 109+7.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integers n and r.

Output:

Output nCr mod 109+7 for each test case in a new line.


Constraints:

1<= T <=100

1<= n, r <=1000


Example:

Input:

1

12 11

Output:

12

** For More Input/Output Examples Use 'Expected Output' option **

Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.