import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


def sieve_of_eratosthenes(n):  # n以下の素数の全列挙
    prime_list = []
    is_prime = [1]*(n+1)  # A[i] = iが素数なら1,その他は0
    is_prime[0] = is_prime[1] = 0
    for i in range(2,int(n**.5)+1):
        if is_prime[i]:
            prime_list.append(i)
            for j in range(i**2,n+1,i):
                is_prime[j] = 0
    for i in range(int(n**.5)+1,n+1):
        if is_prime[i] == 1:
            prime_list.append(i)
    return prime_list


H,W = MI()
mod = 10**9+7

if H == 1 or W == 1:
    ans = H*(W-1)+W*(H-1)
    print(ans % mod)
    exit()

f = [H-i for i in range(H+1)]
g = [W-i for i in range(W+1)]

M = max(H,W)
m = min(H,W)
prime_list = sieve_of_eratosthenes(M)

# f,gを約数ゼータ変換する

for p in prime_list:
    for i in range(H//p,0,-1):
        f[i] += f[i*p]
        f[i] %= mod
    for i in range(W//p,0,-1):
        g[i] += g[i*p]
        g[i] %= mod

# 各点積

h = [(f[i]*g[i]) % mod for i in range(m+1)]

# hを約数メビウス変換する

for p in prime_list:
    for i in range(1,m+1):
        if i*p > m:
            break
        h[i] -= h[p*i]
        h[i] %= mod

ans = H*(W-1)+W*(H-1)+2*h[1]
ans %= mod
print(ans)