#include <bits/stdc++.h>
#define F(i, a, b) for (int i = (a); i <= (b); ++i)
#define dF(i, a, b) for (int i = (a); i >= (b); --i)

using namespace std;
typedef long long LL;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
const int K = 2e5, N = K + 5;
const int B = 448;
const int P = 998244353;
const int I2 = P + 1 >> 1;

int fac[N], inv[N];
int qPow(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = 1ll * res * x % P;
    x = 1ll * x * x % P, y >>= 1;
  }
  return res;
}
int Add(int x, int y) { return x + y >= P ? x + y - P : x + y; }
int Sub(int x, int y) { return x - y < 0 ? x - y + P : x - y; }
int Binom(int x, int y) { return 1ll * fac[x] * inv[y] % P * inv[x - y] % P; }

int m, id[N], ans[N];
struct node { int k, n, id; } s[N];
bool cmp(node x, node y) {
  if (id[x.k] == id[y.k]) return x.n < y.n;
  return x.k < y.k;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> m, fac[0] = 1;
  F(i, 1, K) fac[i] = 1ll * fac[i - 1] * i % P;
  F(i, 0, K) inv[i] = qPow(fac[i], P - 2);
  F(i, 1, K) id[i] = (i - 1) / B;
  F(i, 1, m) {
    cin >> s[i].n >> s[i].k, s[i].id = i;
    --s[i].n, --s[i].k;
  }
  sort(s + 1, s + m + 1, cmp);
  int k = 0, n = 0, now = 1;
  F(i, 1, m) {
    while (k > s[i].k) now = Sub(now, Binom(n, k--));
    while (n < s[i].n) now = Sub(2ll * now % P, Binom(n++, k));
    while (k < s[i].k) now = Add(now, Binom(n, ++k));
    while (n > s[i].n) now = 1ll * I2 * Add(now, Binom(--n, k)) % P;
    ans[s[i].id] = 1ll * now * Sub(qPow(2, s[i].n + 1), 1) % P;
  }
  F(i, 1, m) cout << ans[i] << "\n";
  return 0;
}