|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||100||46||27||48.214%|
Yasser is an Egyptian coach; he will be organizing a training camp in Jordan. At the end of camp, Yasser was quite amazed that the participants solved all of the hard problems he had prepared; so he decided to give them one last challenge:
Print the number of integers having N digits where the digits form a non decreasing sequence.
Input will start with T ≤ 100 number of test cases. Each test case consists of a single line having integer N where 1 ≤ N ≤ 100000.
For each test case print on a separate line the number of valid sequences modulo 1000000007.
3 2 3 4
55 220 715