#include <stdio.h>

const int Mod = 998244353;

int naive(int n, int m)
{
	int i, j, k;
	long long ans = 0, tmp, sum;
	for (i = 1, sum = 0; i <= m; i++) {
		tmp = n / i;
		if (i == m || tmp == n / (i + 1)) break;
		ans += (tmp + 3) * tmp / 2 * i % Mod;
	}
	for (; tmp >= 1; tmp--) {
		i = n / (tmp + 1) + 1;
		j = n / tmp;
		if (i > m) break;
		if (j > m) j = m;
		sum = (long long)(j + i) * (j - i + 1) / 2 % Mod;
		ans += (tmp + 3) * tmp / 2 * sum % Mod;
	}
	return ans % Mod;
}

int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	printf("%d\n", naive(n, m));
	fflush(stdout);
	return 0;
}