#include<bits/stdc++.h>
#include "inv.h"
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
#define eb emplace_back
using namespace std;
const int B = 1024, buf = 3, mod = 998244353, N = 6e6 + 7;
int K, ml[N], iv[N], dis[N];
int Inv(int x) {
	return x < N ? iv[x] : (ll) Inv(mod % x) * (mod - mod / x) % mod;
}
int inv(int w) {
	int d = w >> 10, M = ml[d];
	return !M ? Inv(w) : (ll) iv[w * M - dis[d]] * M % mod;
} 
void init(int rp) {
	K = mod / B;
	L(fb, 1, B * buf) {
		int cur = 0, Add = fb * B;
		for(int p = 0; p <= K; ) {
			if(cur <= K * buf) {
				ml[p] = fb;
				cur += Add, ++p;
			} else {
				int A = (mod - cur + Add - 1) / Add;
				cur += A * Add, p += A;
			}
			if(cur >= mod) cur -= mod; 
		}
	}
	int count = 0;
	L(i, 1, K) if(ml[i]) dis[i] = (ll) ml[i] * i * B / mod * mod, ++count;
//	cout << 1. * count / K << endl;
	iv[1] = 1;
	L(i, 2, N - 1) iv[i] = (ll) iv[mod % i] * (mod - mod / i) % mod;
}