odd doctor 已更新

# CRB and Candies

Time Limit
1s
Memory Limit
65536KB
Judge Program
Standard
Ratio(Solve/Submit)
100.00%(1/1)
Description:

CRB has N different candies. He is going to eat K candies.
He wonders how many combinations he can select.
Can you answer his question for all K(0 ≤ K ≤ N)?
CRB is too hungry to check all of your answers one by one, so he only asks least common multiple(LCM) of all answers.

Input:

There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case there is one line containing a single integer N.
1 ≤ T ≤ 300
1 ≤ N ≤ 106

Output:

For each test case, output a single integer – LCM modulo 1000000007(109+7).

Sample Input:
5
1
2
3
4
5
Sample Output:
1
2
3
12
10

Source:

2015 Multi-University Training Contest 10

Submit