#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

ll jyo(ll a,ll b){
	if(b==0) return 1;
	if(b%2==1) return (a*jyo(a,b-1))%mod;
	return jyo((a*a)%mod,b/2);
}

ll f(ll a){
	a*=(a-1)*(a-2);
	a/=6;
	a%=mod;
	return a;
}

//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	ll N,M;
	cin>>N>>M;
	ll L=200200;
	vector<ll> p(L);
	rep(i,L){
		if(i==0) continue;
		ll x=((2*N-i*((N-1)/i))*(1+(N-1)/i))/2;
		x%=mod;
		ll y=((2*M-i*((M-1)/i))*(1+(M-1)/i))/2;
		y%=mod;
		p[i]=(x*y-N*M+mod*100)%mod;
	}
	ll ans=0;
	for(ll i=L-1;i>0;i--){
		for(ll j=i*2;j<L;j+=i){
			p[i]-=p[j];
			p[i]%=mod;
		}
		ans+=(p[i]*(i-1))%mod;
		ans%=mod;
	}
	ll X=N*M;
	X%=mod;
	X*=((X-1)*(X-2))%mod;
	X%=mod;
	X*=jyo(6,mod-2);
	X%=mod;
	ans*=2;
	ans%=mod;
	ans-=f(N)*M;
	ans%=mod;
	ans-=f(M)*N;
	ans%=mod;
	cout<<(X-ans+mod*2)%mod<<"\n";
}