//qoj3681
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll P = 19940417, i2 = 9970209, i6 = 3323403;
ll n, m;

ll sm(ll x){
	x %= P;
	return x * (x+1) % P * i2 % P;
}
ll sm(ll l, ll r){
	return (sm(r) - sm(l-1) + P) % P;
}
ll pw(ll x){
	x %= P;
	return x * (x+1) % P * (x+x+1) % P * i6 % P;
}
ll pw(ll l, ll r){
	return (pw(r) - pw(l-1) + P) % P;
}
ll clc(ll x){
	ll ans = 0;
	for(ll l = 1, r; l <= x; l = r + 1){
		r = x / (x / l);
		ans = (ans + (x / l) % P * sm(l, r)) % P;
	}
	return ans;
}
ll calc(ll x, ll y){
	ll ans = 0;
	for(ll l = 1, r; l <= min(x, y); l = r + 1){
		r = min(x / (x / l), y / (y / l));
		ans += x * y % P * (r-l+1) % P;
		ans -= y * (x / l) % P * sm(l, r) % P;
		ans -= x * (y / l) % P * sm(l, r) % P;
		ans += (x / l) * (y / l) % P * pw(l, r) % P;
		ans = (ans % P + P) % P;
	}
	return ans;
}

int main(){
	scanf("%lld%lld", &n, &m);
	ll ans = 0;
	ans += (n * n % P + P - clc(n)) * (m * m % P + P - clc(m)) % P;
	ans -= calc(n, m);
	printf("%lld\n", (ans % P + P) % P);
	return 0;
}