def floor_sqrt(n):
  ng,ok=n+1,-1
  while ng-ok>1:
    mid=(ok+ng)//2
    if mid*mid<=n:
      ok=mid
    else:
      ng=mid
  return ok

def solve():
  a,n=map(int,input().split())
  m=floor_sqrt(a*n)
  c=[0]*(a+1)
  for i in range(1,a+1):
    c[i]=c[i-1]+(i*i-1)%a
    c[i]%=mod
  
  num=m*(2*m*m+3*m-5)%mod*inv6%mod
  p,q=m//a,m%a
  num-=c[a]*p+c[q]
  num=num*pow(a,mod-2,mod)%mod
  print((n*m-num)%mod)

mod=10**9+7
inv6=pow(6,mod-2,mod)

for _ in range(int(input())):
  solve()