#include "inv.h"

constexpr int N = 100000000 + 1;
constexpr int mod = 998244353;

int inverse[N];

void init(int p) {
	inverse[1] = 1;
	for (int i = 2; i < N; i++)
		inverse[i] = mod - (long long) (mod / i) * inverse[mod % i] % mod;
}

int inv(int x) {
	if (x < N)
		return inverse[x];
	return mod - (long long) (mod / x) * inv(mod % x) % mod;
}