#include <iostream>
#include <random>
#include <chrono>
#include <iomanip>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <string>
#include <stack>
#include <ranges>
#include <algorithm>
#include <vector>
using namespace std;
using ll=long long;

#include <atcoder/all>
using mint=atcoder::modint998244353;

ostream& operator<<(ostream& os,const mint& x){
	os<<x.val();
	return os;
}
istream& operator>>(istream& is,mint& x){
	int t;
	is>>t;
	x=t;
	return is;
}

template <typename S,typename T>
ostream& operator<<(ostream& os,const pair<S,T>& p);
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p);
template <typename T,size_t n>
ostream& operator<<(ostream& os,const array<T,n>& arr);
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr);
template <typename T>
ostream& operator<<(ostream& os,const vector<T>& vec);
template <typename T>
istream& operator>>(istream& is,vector<T>& vec);

template <typename S,typename T>
ostream& operator<<(ostream& os,const pair<S,T>& p){
	os<<p.first<<" "<<p.second;
	return os;
}
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p){
	is>>p.first>>p.second;
	return is;
}

template <typename T,size_t n>
ostream& operator<<(ostream& os,const array<T,n>& arr){
	for(int i=0;i<n;i++)os<<arr[i]<<(i+1==n?"":" ");
	return os;
}
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr){
	for(int i=0;i<n;i++)is>>arr[i];
	return is;
}
template <typename T>
ostream& operator<<(ostream& os,const vector<T>& vec){
	for(int i=0;i<(int)vec.size();i++)os<<vec[i]<<(i+1==(int)vec.size()?"":" ");
	return os;
}
template <typename T>
istream& operator>>(istream& is,vector<T>& vec){
	for(int i=0;i<(int)vec.size();i++)is>>vec[i];
	return is;
}

template<class... Vecs>
void input_vec(Vecs&... vs) {
    const auto n = get<0>(tie(vs...)).size();

    for (size_t i = 0; i < n; ++i)
        ((cin >> vs[i]), ...);
}

template <typename T>
vector<T> make_unique(vector<T> vec){
	ranges::sort(vec);
	vec.erase(unique(vec.begin(),vec.end()),vec.end());
	return vec;
}

template <typename T, typename Comp = ranges::less, typename Proj = identity>
pair<vector<int>,vector<int>> make_rank(const vector<T>& vec, Comp comp = {}, Proj proj = {}) {
    int n = vec.size();
    vector<int> argsort(n);
    iota(argsort.begin(), argsort.end(), 0);

    ranges::stable_sort(argsort, comp, [&](int i) -> decltype(auto) {
        return invoke(proj, vec[i]);
    });

	vector<int> rank(n);
	for(int i=0;i<n;i++)rank[argsort[i]]=i;
    return make_pair(rank,argsort);
}

void YESNO(bool f){
	if(f)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}

using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using vvvl=vector<vector<vector<ll>>>; 
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vvvi=vector<vector<vector<int>>>;

struct Combination{
	
	Combination(int n){
		init(n);
	}
	Combination(){};
	private:
		int n;
		vector<mint> _fact,_factinv;
		void init(int n){
			this->n=n;
			_fact.resize(n+1,1);_factinv.resize(n+1,1);
			for(int i=0;i<n;i++)_fact[i+1]=_fact[i]*(i+1);
			_factinv[n]=_fact[n].inv();
			for(int i=n-1;i>=0;i--)_factinv[i]=_factinv[i+1]*(i+1);
		}
	public:
		mint fact(int x){
			return _fact[x];
		}
		mint factinv(int x){	
			return _factinv[x];
		}
		mint C(int x,int y){
			assert(0<=x&&x<=n&&0<=y);
			if(x<y)return 0;
			else return _fact[x]*_factinv[y]*_factinv[x-y];
		};
		mint Cinv(int x,int y){
			assert(0<=x&&x<=n&&0<=y);
			if(x<y)return 0;
			else return _factinv[x]*_fact[y]*_fact[x-y];
		}
		mint P(int x,int y){
			assert(0<=x&&x<=n&&0<=y);
			if(x<y)return 0; else return _fact[x]*_factinv[x-y];
		}
		mint Pinv(int x,int y){
			assert(0<=x&&x<=n&&0<=y);
			if(x<y)return 0;
			else return _factinv[x]*_fact[x-y];
		}
		// y/x
		mint frac(int y,int x){
			assert(x!=0);
			if(y==0)return 0;
			else return (_fact[y]*_factinv[y-1]*_factinv[x]*_fact[x-1]);
		}
};

Combination comb;

// \sum_{x=0}^{a-1}\binom{b}{x}
// (a,b)->(a-1,b)
void down_binomsum_a(int& a,int& b,mint& c){
	c-=comb.C(b,a-1);
}
//(a,b)->(a+1,b)
void up_binomsum_a(int& a,int& b,mint& c){
	c+=comb.C(b,a);
}
//(a,b)->(a,b-1)
void down_binomsum_b(int& a,int& b,mint& c){
	if(a!=0) c=(c+comb.C(b-1,a-1))*comb.frac(1,2);
}
//(a,b)->(a,b+1)
void up_binomsum_b(int& a,int& b,mint& c){
	if(a!=0) c=2*c-comb.C(b,a-1);
}
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	ll n,m;
	cin>>n>>m;
	ll N=max(n,m);
	comb=Combination(N+1);

	vl primes,lpf(N+1,-1),cnt(N+1);
	vector<mint> f(N+1);
	f[1]=1;
	for(ll i=2;i<=N;i++){
		if(lpf[i]==-1){
			lpf[i]=i;
			primes.push_back(i);
			f[i]=-comb.frac(i-1,i);
			cnt[i]=1;
		}
		for(ll p:primes){
			if(p>lpf[i]||p*i>N)break;
			ll nxt=i*p;
			lpf[nxt]=p;
			if(lpf[i]==p){
				cnt[nxt]=cnt[i]+1;
				f[nxt]=f[i]*comb.frac(1,lpf[i]);
			}
			else{
				cnt[nxt]=1;	
				f[nxt]=f[i]*f[p];
			}
		}
	}
	mint ans=0;
	for(ll i=1;i<=N;i++){
		mint a=(n/i)*(n/i+1)/2;
		mint b=(m/i)*(m/i+1)/2;
		ans+=f[i]*a*b*i*i;
	}
	cout<<ans<<endl;
}