|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Delete a node from BST|
|K’th smallest element|
|Detect cycle in a directed graph|
|Element with left side smaller and right side greater|
|Sort The Array|
|Level order traversal Line by Line|
|Add two numbers represented by linked lists|
|Root to leaf path sum|
Given 2 number n and r, compute nCr mod 109+7.
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 nCr mod 109+7 for each test case in a new line.
1<= T <=100
1<= n, r <=1000