#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long a, b; cin >> a >> b;
	if (a < b)swap(a, b);
	mint ans = 0;
	if ((0 == a % 2) && (0 == b % 2)) {
		ans += ((mint)a + 0) * ((mint)b + 0);
		ans += ((mint)a + 1) * ((mint)b + 1);
	}
	else if ((0 == a % 2) && (1 == b % 2)) {
		ans += ((mint)a + 0) * ((mint)b + 1);
		ans += ((mint)a + 1) * ((mint)b + 0);
	}
	else if ((1 == a % 2) && (1 == b % 2)) {
		ans += ((mint)a + 0) * ((mint)b + 0);
		ans += ((mint)a + 1) * ((mint)b + 1);
	}
	else {
		ans += ((mint)a + 0) * ((mint)b + 1);
		ans += ((mint)a + 1) * ((mint)b + 0);
	}
	cout << ans.val() << endl;
	return 0;
}