#include"inv.h"
#include<bits/stdc++.h>
using namespace std;
using ll=long long;

constexpr int mod=998244353;

ll exp(ll a, ll w){
    ll ret=1;
    a%=mod;
    while(w){
        if(w&1)ret=1ll*ret*a%mod;
        a=1ll*a*a%mod;
        w>>=1;
    }
    return ret;
}

ll inver[100000000];

int lst=1;

void init(int p){
    inver[1]=1;
}

int inv(int x){
    if(x>=1e8)return exp(x,mod-2);
    while(lst<x){
        inver[lst]=mod-1ll*(mod/lst)*inver[mod%lst]%mod;
        ++lst;
    }
    return inver[x];
}