#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;
    ll odd_a, even_a, odd_b, even_b;
    if (a % 2 == 1) {
        odd_a = 2 * (ll)ceil(a / (double)2) % MOD;
        even_a = (2 * (ll)ceil((a - 1) / (double)2) + 1LL) % MOD;
    } else {
        odd_a = 2 * (a / 2) % MOD;
        even_a = (2 * (a / 2) + 1LL) % MOD;
    }
    if (b % 2 == 1) {
        odd_b = 2 * (ll)ceil(b / (double)2) % MOD;
        even_b = (2 * (ll)ceil((b - 1) / (double)2) + 1LL) % MOD;
    } else {
        odd_b = 2 * (b / 2) % MOD;
        even_b = (2 * (b / 2) + 1LL) % MOD;
    }
    ll res = (odd_a * odd_b) % MOD + (even_a * even_b) % MOD;
    res %= MOD;
    cout << res << endl;
    return 0;
}