#include "inv.h"
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int N = 1e7, mod = 998244353;
int invx[N];
int inv(int x) {
	int res = 1;
	while (x >= N) res = 1ll * res * (mod - mod / x) % mod, x = mod % x;
	return 1ll * res * invx[x] % mod;
}
void init(int p) {
	invx[1] = 1;
	for (int i = 2; i < N; ++ i) 
		invx[i] = 1ll * (mod - mod / i) * invx[mod % i] % mod;
	return;
}