Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Jzzhu and Squares

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputJzzhu 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 (10^{9} + 7).

Input

The first line contains a single integer *t* (1 ≤ *t* ≤ 10^{5}) — the number of tests.

Each of the next *t* lines contains the description of the test: two integers *n* and *m* (1 ≤ *n*, *m* ≤ 10^{6}) — the value of variables for the current test.

Output

For each test output the total number of dots modulo 1000000007 (10^{9} + 7).

Examples

Input

4

1 3

2 2

2 5

3 4

Output

3

8

26

58

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/20/2019 19:31:44 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|