B"Jzzhu has two integers, n and m. He calls an integer point (x, xe2 x80 x89y) of a plane special if 0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89x xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n and 0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89y xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m. Jzzhu defines a unit square as a square with corners at points (x, xe2 x80 x89y), (x xe2 x80 x89+ xe2 x80 x891, xe2 x80 x89y), (x xe2 x80 x89+ xe2 x80 x891, xe2 x80 x89y xe2 x80 x89+ xe2 x80 x891), (x, xe2 x80 x89y xe2 x80 x89+ xe2 x80 x891), 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 xe2 x80 x89+ xe2 x80 x897). The first line contains a single integer t (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89t xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- the number of tests. Each of the next t lines contains the description of the test: two integers n and m (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106) -- the value of variables for the current test. For each test output the total number of dots modulo 1000000007 (109 xe2 x80 x89+ xe2 x80 x897)."...