好有趣
Orz PoPoQQQ
n%k+m%k≥k⟺⌊n+mk⌋−⌊nk⌋−⌊mk⌋=1∑(n%k+m%k≥k)φ(k)=∑n+mk=1φ(k)∗⌊n+mk⌋−∑nk=1φ(k)∗⌊nk⌋−∑mk=1φ(k)∗⌊mk⌋∑ni=1i=∑ni=1∑k|iφ(k)=∑nk=1φ(k)∗⌊nk⌋φ(n)∗φ(m)∗(∑n+mi=1i−∑ni=1i−∑mi=1i)=φ(n)∗φ(m)∗n∗m
#define mod 998244353
#define ll long long
using namespace std;
ll n,m;
ll Phi(ll n){
ll i,re=n;
for(i=2;i*i<=n;i++)
if(n%i==0){
re/=i;re*=i-1;
while(n%i==0)
n/=i;
}
if(n!=1) re/=n,re*=n-1;
return re;
}
int main(){
cin>>n>>m;
cout<<(Phi(n)%mod)*(Phi(m)%mod)%mod*(n%mod)%mod*(m%mod)%mod<<endl;
}
}