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())
  ans=0
  for i in range(1,n+1):
    ans+=floor_sqrt(a*i)
    ans%=mod
  
  print(ans)

mod=10**9+7
for _ in range(int(input())):
  solve()