mod = 10**9+7

def sqrt(x):
    ok = 0
    ng = 10**9+1
    while ng - ok > 1:
        d = (ok+ng)>>1
        if d * d <= x:
            ok = d
        else:
            ng = d
    return ok
def f(a, n):
    ans = 0
    for k in range(1,sqrt(a*n)+1):
        ans += n+1-(k*k+a-1)//a
        #print(n+1-(k*k+a-1)//a)
        ans %= mod
    return ans
def g(a, n):
    N = sqrt(a*n)
    ans = (n+1)*N
    for b in range(a):
        r = (N+b)//a
        l = b//a
        #print(l, r)
        ans -= (b*b+a-1)//a * (r - l)
        ans %= mod
        ans -= a * (r*(r+1)*(2*r+1)//6)
        ans %= mod
        ans += a * (l*(l+1)*(2*l+1)//6)
        ans %= mod
        ans += b*(r*(r+1))
        ans %= mod
        ans -= b*(l*(l+1))
        ans %= mod

    return ans

for _ in range(int(input())):
    a,n = map(int,input().split())
    #ans1 = f(a, n)
    ans = g(a, n)
    print(ans)