#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e7+10,mod=20101009;
int n,m;
int mu[N],pri[N],vis[N],cur,sum[N],soon[N];
int g(ll n,ll m)
{
	return ((ll)1*(n+1)*n/2%mod)*((ll)1*(m+1)*m/2%mod)%mod;
}
int query(int n,int m)
{
	int ret=0;
	for(int l=1,r;l<=min(m,n);l=r+1)
	{
		r=min(n/(n/l),m/(m/l));
		ret+=(ll)1*(sum[r]-sum[l-1]+mod)%mod*g(n/l,m/l)%mod;
		ret%=mod;
	}
	return ret;
}
int main()
{
	scanf("%lld%lld",&n,&m);
	if(n>m)
	{
		swap(n,m);
	}
	mu[1]=1;
	for(int i=2;i<=n;++i)
	{
		if(!vis[i])
		{
			pri[++cur]=i;
			mu[i]=-1;
		}
		for(int j=1;j<=cur&&i*pri[j]<=n;++j)
		{
			vis[i*pri[j]]=1;
			if(i%pri[j]==0)
			{
				mu[i*pri[j]]=0;
				break;
			}
			mu[i*pri[j]]=-mu[i];
		}
	}
	for(int i=1;i<=n;++i)
	{
		sum[i]=sum[i-1]+(ll)1*i*i%mod*(mu[i]+mod)%mod;
		sum[i]%=mod;
	}
	int ans=0;
	for(int l=1,r;l<=min(n,m);l=r+1)
	{
		r=min(n/(n/l),m/(m/l));
		ans+=query(n/l,m/l)%mod*(r-l+1)*(l+r)/2%mod;
		ans%=mod;
	}
	printf("%d",ans);
	return 0;
}