#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);
	int n, m; cin >> n >> m;
	mint nm = n * m;
	mint ans = nm * (nm - 1)*(nm - 2) / 6;
	mint a = ((n + 1) / 2)*((m + 1) / 2);
	mint b = ((n + 0) / 2)*((m + 1) / 2);
	mint c = ((n + 1) / 2)*((m + 0) / 2);
	mint d = ((n + 0) / 2)*((m + 0) / 2);
	//cout << a.val() << endl;
	//cout << b.val() << endl;
	//cout << c.val() << endl;
	//cout << d.val() << endl;
	//cout << ans.val() << endl;
	ans -= a * (a - 1) / 2;
	ans -= b * (b - 1) / 2;
	ans -= c * (c - 1) / 2;
	ans -= d * (d - 1) / 2;
	cout << ans.val() << endl;
	return 0;
}