/* #include namespace my{entry void main(){ LL(N,M); use_ml998244353 vecf=iota(N+1),g=iota(M+1); auto h=index_gcd_convolution(f,g); auto iv=inv_enumerate(min(N,M)+1); ml ans=0; fo(d,1,min(N,M)+1)ans+=iv[d]*h[d]; pp(ans); }}*/ #include #if __has_include() #include #endif using namespace std; #define eb emplace_back #define RD(T,...) T __VA_ARGS__;lin(__VA_ARGS__) #define LL(...) RD(ll,__VA_ARGS__) #define FO(n) for(ll IJK=n;IJK-->0;) #define fo(i,...) for(auto[i,i##stop,i##step]=for_range(0,__VA_ARGS__);i(1,__VA_ARGS__);i>=i##stop;i+=i##step) #define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a) #define defpp templatevoid pp(const auto&...a){[[maybe_unused]]const char*c="";((o<(a...);} #define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{ #define use_ml998244353 using ml=atcoder::modint998244353; namespace my{ auto&operator<<(ostream&o,const atcoder::modint998244353&x){return o<<(int)x.val();} void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<constexpr auto for_range(T s,T b){T a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};} templateconstexpr auto for_range(T s,T a,T b,T c=1){return array{a-s,b,(1-s*2)*c};} void lin(auto&...a){(cin>>...>>a);} auto min(auto...a){return min(initializer_list>{a...});} constexpr ui64 kth_root_floor(ui64 a,ll k){ if (k==1)return a; auto within=[&](ui32 x){ui64 t=1;FO(k)if(__builtin_mul_overflow(t,x,&t))return false;return t<=a;}; ui64 r=0; of(i,sizeof(ui32)*CHAR_BIT)if(within(r|(1u<using pack_back_t=tuple_element_t>; } namespace my{ templatestruct vec; templatestruct hvec_helper{using type=vec::type>;}; templatestruct hvec_helper<0,T>{using type=T;}; templateusing hvec=hvec_helper::type; templatestruct vec:vector{ using vector::vector; ll size()const{return vector::size();} auto&emplace_back(auto&&...a){vector::emplace_back(std::forward(a)...);return*this;} auto pop_back(){auto r=this->back();vector::pop_back();return r;} }; templaterequires(sizeof...(A)>=2)vec(const A&...a)->vec>>; templateauto iota(ll l,ll r=0){if(l>r)swap(l,r);vecv(r-l);std::iota(v.begin(),v.end(),l);return v;} auto iota_transform(ll n,auto&&f){vecr(n);fo(i,n)r[i]=f(i);return r;} } namespace my{ templateauto inv_enumerate(ll n){ vecv(n+1); v[0]=0; if(n>=1)v[1]=1; fo(i,2,n+1)v[i]=-v[T::mod()%i]*(T::mod()/i); return v; } } namespace my{ templateauto hadamard_product(const vec&x,const vec&y){return iota_transform(min(x.size(),y.size()),[&](ll i){return x[i]*y[i];});} } namespace my{ auto prime_enumerate(ll n){ vecsieve(n/3+1,1); for(ll p=5,d=4,i=1,rn=sqrt_floor(n);p<=rn;p+=d=6-d,i++){ if(!sieve[i])continue; for(ll q=(p*p)/3,r=d*p/3+(d*p%3==2),s=p*2;qr{2,3}; for(ll p=5,d=4,i=1;p<=n;p+=d=6-d,i++)if(sieve[i])r.eb(p); while(r.size()&&r.back()>n)r.pop_back(); return r; } } namespace my{ templateauto&multiple_zeta(vec&a){ll n=a.size()-1;fe(prime_enumerate(n),p)of(i,n/p+1,1)a[i]+=a[i*p];return a;} templateauto&multiple_mobius(vec&a){ll n=a.size()-1;fe(prime_enumerate(n),p)fo(i,1,n/p+1)a[i]-=a[i*p];return a;} templateauto index_gcd_convolution(veca,vecb){ multiple_zeta(a);multiple_zeta(b); a=hadamard_product(a,b); return multiple_mobius(a); } } namespace my{entry void main(){ LL(N,M); use_ml998244353 vecf=iota(N+1),g=iota(M+1); auto h=index_gcd_convolution(f,g); auto iv=inv_enumerate(min(N,M)+1); ml ans=0; fo(d,1,min(N,M)+1)ans+=iv[d]*h[d]; pp(ans); }}