TRENDGCD - Trending GCD

给出 n 和 m ，求: $$ \sum_{i=1}^{n}\sum_{j=1}^{m} i\cdot j\cdot f(\gcd(i,j)) $$ 其中： $$ f(n) =\begin{cases}1,& n=1\\n,& n>1,\text{ n 不能被平方数整除}\\ 0,& n>1,\text{ n 能被平方数整除}\end{cases} $$ 简而言之： $$f(n) =\mu^{2}(n)\cdot n$$ 数据范围 $10^6$ ，多组询问。

Problem statement is simple. Given **A** and **B** you need to calculate **S(A,B) .**  Here, **f(n)=n, if n is square free otherwise 0**. Also **f(1)=1**.

The first line contains one integer **T** - denoting the number of test cases. **T** lines follow each containing two integers **A,B**.

For each testcase output the value of S(A,B) mod 1000000007 in a single line.

3
42 18
35 1
20 25

306395
630
128819