import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")

h,w = list(map(int, input().split()))
m = min(h,w)
f = [0]*(m+1)
M = 10**9+7
def subh(k):
    num = h//k
    return h*num - (k + num*k)*num//2
def subw(k):
    num = w//k
    return w*num - (k + num*k)*num//2
def hurui(n):
    """線形篩
    pl: 素数のリスト
    mpf: iを割り切る最小の素因数
    """
    pl = []
    mpf = [None]*(n+1)
    for d in range(2,n):
        if mpf[d] is None:
            mpf[d] = d
            pl.append(d)
        for p in pl:
            if p*d>n or p>mpf[d]:
                break
            mpf[p*d] = p
    return pl, mpf
_,mpf = hurui(m+1)
# pl.insert(0,1)
for p in range(m, 0, -1):
    f[p] += subh(p)*subw(p)
    if mpf[p]!=p:
        continue
    num = m//p
    for k in range(1,num+1):
        f[k] -= f[k*p]
        f[k] %= M
# for k in range(m, 0, -1):
#     f[k] = subh(k)*subw(k)
#     for i in range(2*k, m+1, k):
#         f[k] -= f[i]
#         f[k] %= M
#     f[k] %= M
ans = (f[1]*2 + (h-1)*w + h*(w-1))%M
print(ans%M)