#include <bits/stdc++.h>
using namespace std;
#define ll long long
# define int long long
#define ull unsigned long long
#define pii pair<int,int>

#define baoliu(x, y) cout << fixed << setprecision(y) << x
#define endl  "\n"
#define debug1(x) cerr<<x<<" "
#define  debug2(x) cerr<<x<<endl
const int N = 2e5 + 10;
const int M = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const int mod = 1000000009;
const int P = 998244353;
const double eps = 1e-8;
int n, m;
int a[N];

void solve(){
	 int n, a0;
    cin >> n >> a0;
    vector<int> a(n + 1);
    a[0] = a0;
    for (int i = 1; i <= n; i++) {
        a[i] = (998244353LL * a[i - 1] + 1000000007) % mod;
    }

    vector<int> p(n + 1);
    iota(p.begin(), p.end(), 0);
    for (int i = 1; i <= n; i++) {
        swap(p[i], p[(a[i] % i) + 1]);
    }
    int pw=19;int ans=0;
    priority_queue<int>maxheap;
    priority_queue<int,vector<int>,greater<int>>minheap;
    for(int i=1;i<=n;i++){
    	int num=i+1-(i+1)/2;//第（i+1)/2小转化成第k大
    	if(minheap.empty()||p[i]>=minheap.top())minheap.push(p[i]);
    	else maxheap.push(p[i]);
    	
    	
    	while(minheap.size()>num){
    		maxheap.push(minheap.top());
    		minheap.pop();
    	}
    	while(minheap.size()<num){
    		minheap.push(maxheap.top());
    		maxheap.pop();
    	}
    	ans+=pw*minheap.top()%P;pw=(pw*19)%P;
    	ans%=P;
    	
    }
    cout<<ans<<endl;
}
signed main() {
    cin.tie(0);
    
    ios::sync_with_stdio(false);

    int t;
   //cin>>t;
     t=1;
    while (t--) {
solve();
    }
    return 0;
}