4411: Bash Plays with Functions
内存限制：256 MB
时间限制：2 S
题面：传统
评测方式：文本比较
上传者：
提交：2
通过：2
题目描述
time limit per test
3 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputBash got tired on his journey to become the greatest Pokemon master. So he decides to take a break and play with functions.
Bash defines a function f0(n), which denotes the number of ways of factoring n into two factors p and q such that gcd(p,q)=1. In other words, f0(n) is the number of ordered pairs of positive integers (p,q) such that p·q=n and gcd(p,q)=1.
But Bash felt that it was too easy to calculate this function. So he defined a series of functions, where fr+1 is defined as:
Now Bash wants to know the value of fr(n) for different r and n. Since the value could be huge, he would like to know the value modulo 109+7. Help him!
Bash defines a function f0(n), which denotes the number of ways of factoring n into two factors p and q such that gcd(p,q)=1. In other words, f0(n) is the number of ordered pairs of positive integers (p,q) such that p·q=n and gcd(p,q)=1.
But Bash felt that it was too easy to calculate this function. So he defined a series of functions, where fr+1 is defined as:
Now Bash wants to know the value of fr(n) for different r and n. Since the value could be huge, he would like to know the value modulo 109+7. Help him!
Input
The first line contains an integer q (1≤q≤106)− the number of values Bash wants to know.Each of the next q lines contain two integers r and n (0≤r≤106, 1≤n≤106), which denote Bash wants to know the value fr(n).
Output
Print q integers. For each pair of r and n given, print fr(n) modulo 109+7 on a separate line.Example
Input
5
0 30
1 25
3 65
2 5
4 48
Output
8
5
25
4
630
输入样例 复制
输出样例 复制