#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/modint>
using mint = atcoder::modint1000000007;

int64_t sign(int64_t x) {
    return clamp<int64_t>(x, -1, 1);
}

int64_t floor(int64_t x, int64_t y) {
    if (0 < sign(x) * sign(y)) {
        return x / y;
    }
    return -((abs(x) + abs(y) - 1) / abs(y));
}

int main() {
    int64_t a, b; cin >> a >> b;

    auto ab = floor(a - b, 2);
    auto ba = floor(b - a, 2);

    mint ans = 0;
    if (ab < ba) {
        ans += mint(ba - ab) * (2 * a + 1);
    }
    if (ba < ab) {
        ans += mint(ab - ba) * (2 * b + 1);
    }

    if (floor(-(a + b + 1), 2) < min(ab, ba)) {
        auto l = floor(-(a + b + 1), 2);
        auto r = min(ab, ba);
        ans += mint(a + b + 1) * (r - l) + mint(r - l) * (2 * (l + 1) + (r - l - 1));
    }
    if (max(ab, ba) < floor(a + b + 1, 2)) {
        auto l = max(ab, ba);
        auto r = floor(a + b + 1, 2);
        ans += mint(a + b + 1) * (r - l) - mint(r - l) * (2 * (l + 1) + (r - l - 1));
    }

    cout << ans.val() << endl;
}