#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma optimized("O2")
#define sc cerr
#define qlog(x) {sc<<#x<<" = "<<(x)<<"\n";}
#define rep(i,l,r) for(int i=(l);i<=(r);i++) 
#define irep(i,r,l) for(int i=(r);i>=(l);i--) 
#define qloga(a,l,r) {sc<<#a<<": "; rep(I,(l),(r)){sc<<a[I]<<" ";}sc<<"\n";}
#define qlogSTL(a) {sc<<#a<<": "; for(const auto &I:(a)){sc<<I<<" ";}sc<<"\n";}
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;

constexpr int N=3e6+10;
int mu[N],n,m;

void euler(){
	vector<int> prime;
	memset(mu,0x3f,sizeof(mu));
	mu[1]=1;
	for(int v=2;v<N;v++){
		if(mu[v]>1){
			mu[v]=-1;
			prime.push_back(v);
		}
		for(int x:prime)if(v*x<N){
			if(v%x==0){
				mu[v*x]=0;
				break;
			}else{
				mu[v*x]=-mu[v];
			}
		}else break;
	}
}

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);	

	cin>>n>>m;
	euler();
	static constexpr int M=1e9+7;
	ll ans=0;

	rep(d,1,min(n,m)){
		ll A=0, B=0;
		for(int x=d;x<=n;x+=d) A+=n-x;
		for(int y=d;y<=m;y+=d) B+=m-y;
		mu[d]=(mu[d]+M)%M;
		ans+=(A%M)*(B%M)%M*mu[d]%M;
	}
	(ans*=2)%=M;
	ans+=((n-1)*m+(m-1)*n)%M;
	cout<<ans%M;
}