|All-time Popular Problems|
|Find duplicates in an array|
|Triplet Sum in Array|
|Sorting Elements of an Array by Frequency|
|Search an Element in an array|
|Diameter of Binary Tree|
|Maximum of all subarrays of size k|
|Leaders in an array|
|Find median in a stream|
|Reverse a Linked List in groups of given size.|
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