H,W = map(int,input().split())
C = max(H,W)+1
dat = [0] * C
h = [0] + [H - i for i in range(1,H)] + [0] * (C - H)
w = [0] + [W - i for i in range(1,W)] + [0] * (C - W)

prime = set()
P = 10 ** 9 + 7
for i in range(2,C):
    if dat[i] == 0:
        for j in range(2 * i,C,i):
            dat[j] = 1
        prime.add(i)
for p in prime:
    for j in range((C-1)//p,0,-1):
        h[j] += h[j*p]
        h[j] %= P
        w[j] += w[j*p]
        w[j] %= P
z = [i * j % P for i,j in zip(h,w)]

for p in prime:
    if p > C - 1:break
    for j in range(1,(C-1)//p+1):
        z[j] -= z[j*p]
ans = z[1] * 2 % P + (H-1) * W % P + (W - 1) * H % P
print(ans % P)