#include <bits/stdc++.h>
using namespace std;

void main_program();

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	main_program();
}

#define int long long
const int mod = 19940417;
const int inv2 = (mod + 1) / 2;
const int inv6 = (mod + 1) / 6;

int n, m;
vector<int> events;

void split(int x){
	for (int i = 1, lim = 0; i <= x; i = lim + 1){
		lim = x / (x / i);
		events.push_back(lim + 1);
	}
}

int range_sum(int l, int r){
	return (l + r) * (r - l + 1) % mod * inv2 % mod;
}

int prefix_squared(int x){
	if (x <= 0) return 0;
	return x * (x + 1) % mod * (x * 2 + 1) % mod * inv6 % mod;
}

int range_sum_squared(int l, int r){
	return (prefix_squared(r) - prefix_squared(l - 1)) % mod;
}

void main_program(){
	cin >> n >> m;

	split(n); split(m);
	events.push_back(n);
	events.push_back(m);

	sort(events.begin(), events.end());
	events.resize(unique(events.begin(), events.end()) - events.begin());

	int sum_n = 0, sum_m = 0, sum_nm = 0;
	{
		int L = 1;
		int& total = sum_n;
		for (auto nxt: events){
			int R = nxt - 1;
			if (L > R) continue;
			if (L > n) continue;

			int val = n / L;
			int sum = n * (R - L + 1) % mod - val * range_sum(L, R) % mod;
			total = (total + sum) % mod;

			L = nxt;
		}
	}
	{
		int L = 1;
		int& total = sum_m;
		for (auto nxt: events){
			int R = nxt - 1;
			if (L > R) continue;
			if (L > m) continue;

			int val = m / L;
			int sum = m * (R - L + 1) % mod - val * range_sum(L, R) % mod;
			total = (total + sum) % mod;

			L = nxt;
		}
	}
	{
		int L = 1;
		int& total = sum_nm;
		for (auto nxt: events){
			int R = nxt - 1;
			if (L > R) continue;
			if (L > min(n, m)) continue;

			int ndiv = n / L, mdiv = m / L;
			int sum = n * m % mod * (R - L + 1) % mod
				- n * mdiv % mod * range_sum(L, R) % mod
				- m * ndiv % mod * range_sum(L, R) % mod
				+ ndiv * mdiv % mod * range_sum_squared(L, R) % mod;

			total = (total + sum) % mod;

			L = nxt;
		}
	}

	int res = sum_n * sum_m % mod - sum_nm;
	cout << (res % mod + mod) % mod << "\n";
}