#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define rreps(i, n, s) for (int i = s; i >= n; i--)

using ll = long long;
using namespace std;
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int MOD = 1000000007;
class mint {
  public:
    long long x;
    mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
    mint operator-() const { return mint(-x); }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint& a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res *= a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return a;
    }
    // for prime MOD
    mint inv() const { return pow(MOD - 2); }
    mint& operator/=(const mint& a) { return (*this) *= a.inv(); }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res /= a;
    }

    friend ostream& operator<<(ostream& os, const mint& m) {
        os << m.x;
        return os;
    }
};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll a, b;
    cin >> a >> b;
    if (a < b) swap(a, b);
    mint x1 = ceil((long double)(-a - b) / 2.0);
    mint x2l = floor((long double)(b - a) / 2.0);
    x2l.x = max(x1.x, x2l.x);
    mint x2r = ceil((long double)(b - a) / 2.0);
    mint x3l = floor((long double)(a - b) / 2.0);
    mint x3r = ceil((long double)(a - b) / 2.0);
    mint x4 = floor((long double)(a + b) / 2.0);
    x3r.x = min(x3r.x, x4.x);
    mint dy1 = ((x1 + b) - (-x1 - a) + 1LL);
    mint dy2l = ((x2l + b) - (-x2l - a) + 1LL);
    mint dy2r3l = ((x2r + b) - (x2r - b) + 1LL);
    mint dy3r = ((-x3r + a) - (x3l - b) + 1LL);
    mint dy4 = ((-x4 + a) - (x4 - b) + 1LL);

    mint res = 0;

    res += (x2l - x1 + 1LL) * (dy1 + dy2l) / 2.0;
    res += (x3l - x2r + 1LL) * dy2r3l;
    res += (x4 - x3r + 1LL) * (dy3r + dy4) / 2.0;
    if (x2l.x == x2r.x) res -= dy2l;
    if (x3l.x == x3r.x) res -= dy3r;
    cout << res << endl;
    return 0;
}