mod=10**9+7
def cmb(n,r):
  if r<0 or r>n:
    return 0
  return (g1[n]*g2[r]*g2[n-r])%mod
 
N=500000
g1=[1]*(N+3)
for i in range(2,N+3):
  g1[i]=g1[i-1]*i%mod
g2=[0]*len(g1)
g2[-1]=pow(g1[-1],mod-2,mod)
for i in range(N+1,-1,-1):
  g2[i]=g2[i+1]*(i+1)%mod
inv=[0]*(N+3)
for i in range(1,N+3):
  inv[i]=g2[i]*g1[i-1]%mod
N,M=map(int,input().split())
X=[0]*(N+M+2)
Y=[0]*(N+M+2)
Y[N]+=M
for i in range(-N,N+1):
  if i==0:
    Y[M]+=N
    continue
  i=abs(i)
  y=(N-1)//i+1
  if y>=M:
    z=(M-1)*i
    Y[M]+=N-z
    X[0]+=i*2
    X[M]-=i*2
  else:
    z=(y-1)*i
    Y[y]+=(M-y+1)*(N-z)
    X[0]+=i*2
    X[y]-=i*2
N,M=M,N
for i in range(-N,N+1):
  if abs(i)<=1:
    continue
  i=abs(i)
  y=(N-1)//i+1
  if y>=M:
    z=(M-1)*i
    Y[M]+=N-z
    X[0]+=i*2
    X[M]-=i*2
  else:
    z=(y-1)*i
    Y[y]+=(M-y+1)*(N-z)
    X[0]+=i*2
    X[y]-=i*2
L=N*M
ANS=L*(L-1)*(L-2)//6
for i in range(N+M):
  X[i+1]+=X[i]
  ANS-=cmb(i+1,3)*(X[i+1]+Y[i+1])
print(ANS%mod)