mod=10**9+7
def solve():
  A,N=map(int,input().split())
  C=[0]*A
  M=A*N
  R=0
  for i in range(31,-1,-1):
    v=R+(1<<i)
    if v*v<=M:
      R=v
  V=0
  for k in range(1,A+1):
    v=(R+A-k)//A
    C[(k*k-1)%A]+=v
  for i in range(A):
    C[i]%=mod
    V=(V+i*C[i])%mod
  W=R*(R+1)*(2*R+1)//6
  W=(W-R)%mod
  W=(W-V)%mod
  W=W*pow(A,mod-2,mod)%mod
  #print(R,N,W)
  print((R*N-W)%mod)

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