#include<bits/stdc++.h>
#include "inv.h"
using namespace std;
using ll=long long;
const int N=1e8+8,M=998244353;
int nv[N];
void init(int p){
	int x;
	nv[0]=nv[1]=1;
	for(x=2;x<N;++x)
		nv[x]=ll(M-M/x)*nv[M%x]%M;
}
int sol(int d){
	if(d<N)return nv[d];
	if(d<M-d){
		return ll(M-M/d)*sol(M%d)%M;
	}else{
		d=M-d;
		return ll(M/d)*sol(M%d)%M;
	}
}
int inv(int x){
	ll res=1;
	while(x>=N){
		x<M-x?res=-res:x=M-x;
		res=res*(M/x)%M;
	}res=res*nv[x]%M;
	return res<0?res+M:res;
}