1177: 迷失方阵

def count_squares(N, M):
    # 取N和M中的较小值作为最大边长
    max_size = min(N, M)
    result = 0
    # 依次计算边长为1到max_size的正方形数量
    for size in range(1, max_size + 1):
        # 计算当前边长的正方形数量
        num_squares = (N - size + 1) * (M - size + 1)
        result += num_squares
    return result
# 示例用法
while True:
    try:
        s=input()
        N = int(s.split()[0])
        M = int(s.split()[1])
        result = count_squares(N, M)
        print(result%1000000007)
    except EOFError:
        break