#include "inv.h"
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353, N = 1e8;
typedef long long ll;
int invv[N];
void init(int p)
{
    invv[0] = invv[1] = 1;
    for (int i = 2; i <= 4e7; i++) invv[i] = (1ll * (mod - mod / i) * invv[mod % i]) % mod;
}
int inv(int x)
{
    if (x <= 4e7) return invv[x];
    return (1ll * (mod - mod / x) * (ll)(inv(mod % x))) % mod;
}