#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n,s[300010];
ll h,w;
ll a[300010],b[300010],A[300010],B[300010];


void solve(){
	cin >> h >> w;
	n=max(h,w);
	Rep(i,1,h) a[i]=h-i;
	Rep(i,1,w) b[i]=w-i;
	s[1]=-1;
	Rep(i,1,n+1){
		int k=1;
		s[i]*=-1;
		A[i]+=a[i];
		B[i]+=b[i];
		A[i]%=mod;
		B[i]%=mod;
		//cout << i << " " << s[i] << " " << A[i] << " " << B[i] << endl;
		for(int k=2*i;k<n+1;k+=i){
			s[k]+=s[i];
			A[i]+=a[k];
			B[i]+=b[k];
			A[i]%=mod;
			B[i]%=mod;
		}
	}
	ll ans=h*(w-1)+w*(h-1);
	ans%=mod;
	Rep(i,1,n+1){
		ans+=2*s[i]*A[i]*B[i];
		ans%=mod;
	}
	cout << ans << endl;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(50);
	solve();
}