#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 19940417
#define qm(x) (x>mod)?x-mod:x
// By flyfreemrn
inline ll read(){
	ll x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
inline void write(ll x){
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
ll sumn,summ,n,m,sum;
int main(){
	freopen("modmuladd.in","r",stdin);
	freopen("modmuladd.out","w",stdout);
	n=read(),m=read();
	for(int i=1;i<=n;i++){
		sumn=qm(sumn+n%i);
	}
	for(int i=1	;i<=m;i++){
		summ=qm(summ+m%i);
	}
	for(int i=1;i<=min(n,m);i++){
		sum=qm(sum+(n%i)*(m%i)%mod);
	}
//	cout<<sumn<<" "<<summ<<" "<<sum<<endl;
	cout<<(sumn*summ%mod-sum+mod)%mod;
	return 0;
}