import sys
from operator import itemgetter
from collections import defaultdict, deque
import heapq
import bisect

stdin=sys.stdin
sys.setrecursionlimit(10 ** 8)

ip=lambda: int(sp())
fp=lambda: float(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
Yp=lambda:print('Yes')
Np=lambda:print('No')
inf = 1 << 60
eps = 1e-9
sortkey = itemgetter(0)
mod = 10 ** 9 + 7

###############################################################

A, B = lp()
A, B = max(A, B), min(A, B)
if B == 0:
    ans = 1 + A // 2 * 2
else:
    ans = 0
    if (A + B) % 2 == 0:
        x = B * 2 + 1
        wide = (A - B) // 2
        ans += (2 * wide + 1) * x 
        p = (x - 1) // 2 + 1
        ans += (x + 1) * p 
        ans -= 2 * x
    else:
        x = B * 2 + 1
        wide = (A - B) // 2
        ans += (wide * 2 + 1) * x
        x -= 1
        p = (x - 2) // 2 + 1
        ans += (x + 2) * p
    ans %= mod
print(ans)