//  __  __   _  _____ _   _   _____   ______          __
//  \ \/ /  / \|_   _| | | | |  __ \ / __ \ \   /\   / /
//   \  /  / _ \ | | | | | | | |  | | |  | \ \ /  \ / /
//   /  \ / ___ \| | | |_| | | |__| | |__| |\ V /\ V /
//  /_/\_/_/   \_\_|  \___/  |_____/ \___\_\ \_/  \_/ (TM)

#include <bits/stdc++.h>
#include "inv.h"
using namespace std;
#define ll long long
const int mod=998244353;
int invs[10000001];
void init(int p)
{
    invs[1] = 1;
    for (int i = 2; i <= 10000000; i++)
    {
        invs[i] = (mod - (ll)mod / i) * invs[mod % i] % mod;
    }
}
int inv(int x)
{
	if(x<=10000000)return invs[x];
	return mod-(ll)mod/x*inv(mod%x)%mod;
}