#include<bits/stdc++.h>
#define maxn 10000010
#define LL long long
using namespace std;
const LL mod=(LL)998244353;
bool bk[maxn];
int p[maxn],mu[maxn],sum[maxn],lp;
LL ans=0,n,m;
int main(){
	freopen("hoip.in","r",stdin);
	freopen("hoip.out","w",stdout);
	mu[1]=1;
	for(int i=2;i<=maxn-10;i++){
		if(bk[i]==0)p[++lp]=i,mu[i]=-1;
		for(int j=1;j<=lp;j++){
			if(p[j]*i>maxn-10)break;
			bk[i*p[j]]=1;
			if(i%p[j]==0)break;
			mu[i*p[j]]=-mu[i];
		}
	}
	for(int i=1;i<=maxn-10;i++)
	    for(int j=i;j<=maxn-10;j+=i)
	        sum[j]=(sum[j]+mu[j/i]*i)%mod;
	for(int i=1;i<=maxn-10;i++)sum[i]=(sum[i]+sum[i-1])%mod;
	scanf("%lld%lld",&n,&m);
	if(n>m){LL fz=n;n=m;m=fz;}
	for(int i=1,j;i<=n;i=j+1){
		j=min(n/(n/i),m/(m/i));
		ans=(ans+(LL)(n/i)*(LL)(m/i)%mod*(LL)(sum[j]-sum[i-1])%mod)%mod;
	}
	printf("%lld\n",(ans%mod+mod)%mod);
	return 0;
}