#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;

using mint = atcoder::static_modint<998243353>;

const int MAX = 510000;
mint fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
	const int MOD = mint::mod();
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++){
		fac[i] = fac[i - 1] * i;
		inv[i] = MOD - inv[MOD%i] * (MOD / i);
		finv[i] = finv[i - 1] * inv[i];
	}
}

// 二項係数計算
mint COM(int n, int k){
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * finv[k] * finv[n - k];
}

int main(){
	cin.tie(0)->ios::sync_with_stdio(0);
	COMinit();
	int TT,T;
	cin >> TT >> T;
	for(int ii=0;ii<T;ii++){
		if(ii==T-1){
			cout << -1 << endl;
			continue;
		}
		int N,M;
		cin >> N >> M;
		//MCN
		cout << COM(M,N).val() << '\n';
	}
}