#include<bits/stdc++.h>
#define int long long
using namespace std;
const int M=19940417;
int calc4(int x,int y,int z){
	if(x%2==0)x/=2;
	else if(y%2==0)y/=2;
	else if(z%2==0)z/=2;
	if(x%3==0)x/=3;
	else if(y%3==0)y/=3;
	else if(z%3==0)z/=3;
	return x*y%M*z%M;
}
int calc3(int l,int r){
	--l; int res1=calc4(l,l+1,2*l+1);
	int res2=calc4(r,r+1,2*r+1);
	return (res2-res1+M)%M;
}
int calc2(int l,int r){
	return (r*(r+1)/2-l*(l+1)/2+l+M)%M;
}
int calc1(int n,int k){
	int res=0;
	for(int l=1;l<=n;){
		int r=k/(k/l);
		if(r>n)r=n;
		int v=k/l;
		res=(res+v*calc2(l,r)%M)%M;
		l=r+1;
	} return res;
}
int calc0(int n,int m){
	int res=0;
	for(int l=1;l<=n;){
		int r=min(n/(n/l),m/(m/l));
		int v=(n/l)*(m/l)%M;
		res=(res+v*calc3(l,r)%M)%M;
		l=r+1;
	} return res;
}
signed main(){
	int n,m; cin>>n>>m;
	if(n>m)swap(n,m);
	int ans=((n*n%M-calc1(n,n)+M)%M);
	ans=(ans*((m*m%M-calc1(m,m)+M)%M))%M;
	ans=(ans-n*n%M*m%M+M)%M;
	ans=(ans+m%M*calc1(n,n))%M;
	ans=(ans+n%M*calc1(n,m))%M;
	ans=(ans-calc0(n,m)+M)%M;
	cout<<ans; return 0;
}