#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<i64(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;

#include <atcoder/modint>
using Modint = atcoder::static_modint<998244353>;
const i64 Z = 200000;
vector<Modint> F(Z+1), IF(Z+1);

void testcase(){
    i64 T; cin >> T >> T;
    rep(t,T-1){
        i64 N, M; cin >> M >> N;
        cout << (F[N] * IF[M] * IF[N-M]).val() << "\n";
    }
    i64 N, M; cin >> N >> M;
    cout << "-1\n";
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    F[0] = 1;
    for(i64 i=1; i<=Z; i++) F[i] = F[i-1] * i;
    IF[Z] = F[Z].inv();
    for(i64 i=Z; i>=1; i--) IF[i-1] = IF[i] * i;
    testcase();
    return 0;
}