#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e7+10;
const ll mod=998244353;
const ll sb=1e9;
ll n,a[N],p[N];
ll qpow(ll a,ll b){
    ll ans=1,tmp=a;
    while(b){
        if(b&1) ans=(ans*tmp)%mod;
        tmp=(tmp*tmp)%mod;
        ans%=mod;
        b>>=1;
    }
    return ans;
}
ll work(ll k,ll i){
    return (k%mod)*qpow(19,i)%mod;
}
void solve(){
    cin>>n>>a[0];
    for(int i=1;i<=n;i++){
        a[i]= (a[i-1]* mod%(sb+9)+sb+7 )%(sb+9);
        p[i]=i;
    }
    for(int i=1;i<=n;i++){
        swap(p[i],p[a[i]%i+1]);
    }
    //cout<<66<<endl;
    ll ans=0;
    priority_queue<ll,vector<ll>,less<ll>>q1;//
    priority_queue<ll,vector<ll>,greater<ll>>q2;//
    q1.push(-1e12),q2.push(1e12);
    for(int i=1;i<=n;i++){
        if(i==1) ans=(ans+work(p[i],i))%mod,q1.push(p[i]);
        else{

            if(p[i]>q2.top()) q2.push(p[i]);
            else q1.push(p[i]);
            if(q1.size()!=q2.size()){
                if(q1.size()==q2.size()+2){
                   ll hy=q1.top();
                   q1.pop();
                   q2.push(hy);
                }else if(q2.size()==q1.size()+1){
                    ll hy=q2.top();
                    q2.pop();
                    q1.push(hy);
                }

            }
            ans=(ans+work(q1.top(),i)%mod)%mod;

        }
        //cout<<p[i]<<" "<<q1.top()<<endl;

    }
    cout<<ans<<endl;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}