#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define mod 998244353
ll Power(ll a,ll b,ll m){
    ll p=a,Answer=1;
    for(int i=0;i<30;i++){
        int wari=(1<<i);
        if((b/wari)%2==1){
            Answer=(Answer*p)%m;
        }
        p=(p*p)%m;
    }
    return Answer;
}
ll Division(ll a,ll b,ll m){
    return (a*Power(b,m-2,m))%m;
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    int T1,T2;
    cin>>T1>>T2;
    int N[200009],M[200009];
    ll data[200009];
    ll x=1;
    data[0]=1;
    for(int i=1;i<=200001;i++){
        x*=i;
        x%=mod;
        data[i]=x;
    }
    for(int i=1;i<T1;i++){
        cin>>N[i]>>M[i];
        ll bunbo=(data[N[i]]*data[M[i]-N[i]])%mod;
        cout<<Division(data[M[i]],bunbo,mod)<<endl;
    }
    cout<<-1<<endl;
}