CF449E.Jzzhu and Squares
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Jzzhu has two integers, n and m . He calls an integer point (x,y) of a plane special if 0<=x<=n and 0<=y<=m . Jzzhu defines a unit square as a square with corners at points (x,y) , (x+1,y) , (x+1,y+1) , (x,y+1) , where x and y are some integers.
Let's look at all the squares (their sides not necessarily parallel to the coordinate axes) with corners at the special points. For each such square Jzzhu paints a dot in every unit square that is fully inside it. After that some unit squares can contain several dots. Now Jzzhu wonders, how many dots he has painted on the plane. Find this number modulo 1000000007 (109+7) .
输入格式
The first line contains a single integer t (1<=t<=105) — the number of tests.
Each of the next t lines contains the description of the test: two integers n and m (1<=n,m<=106) — the value of variables for the current test.
输出格式
For each test output the total number of dots modulo 1000000007 (109+7) .
输入输出样例
输入#1
4 1 3 2 2 2 5 3 4
输出#1
3 8 26 58