eolymp
bolt
Try our new interface for solving problems
Problems

Children`s shop

Children`s shop

In the children's shop brought n identical blocks. To maintain the diversity of assortment management of the shop decided to make them colorful. It is possible to paint the cubes in \textbf{k} different colors, and do not necessarily use all the colors. Determine the numbers \textbf{n} and \textbf{k} as there are options for coloring (different options are considered, in which different blocks of at least one color). \InputFile he first line of the input file contains the number of tests \textbf{t} (\textbf{1} ≤ \textbf{t} ≤ \textbf{10}). Each test consists of a single string containing a space of \textbf{n} and \textbf{k} (\textbf{1} ≤ \textbf{n}, \textbf{k} ≤ \textbf{10^18}). \OutputFile For each test case output the line that contains the answer to the problem. Since the answer may be large enough to carry him out modulo \textbf{1000000007} (\textbf{10^9+7}).
Time limit 1 second
Memory limit 64 MiB
Input example #1
3
3 1
3 2
5 2
Output example #1
1
4
6
Author Evgeniy Sluzhaev