#include <bits/stdc++.h>
#define int long long

using namespace std;

const int kMaxN = 2e5 + 5, kM = 998244353, Inv = (kM + 1) / 2;

int n, s = 1, len, ans[kMaxN], inv[kMaxN], fac[kMaxN];
struct Node {
  int l, r, id;
  bool operator<(const Node &_) const {
    return l / len != _.l / len ? l / len < _.l / len : r < _.r;
  }
} q[kMaxN];

template <typename T>
T W(T a, T n, T kM, T r = 1) {
  for (T i = 1; i <= n; n & i && (r = r * a % kM), a = a * a % kM, i <<= 1);
  return r;
}
int C(int x, int y) {
  if (x < 0 || y < 0 || x < y) return 0;
  return fac[x] * inv[y] % kM * inv[x - y] % kM;
}

signed main() {
  cin.tie(0)->ios::sync_with_stdio(0);
  fac[0] = inv[0] = 1;
  for (int i = 1; i < kMaxN; i++) {
    fac[i] = fac[i - 1] * i % kM;
    inv[i] = W(fac[i], kM - 2, kM);
  }
  cin >> n, len = sqrt(n);
  for (int i = 1; i <= n; i++) {
    cin >> q[i].l >> q[i].r;
    q[i].l--, q[i].r--, q[i].id = i;
  }
  sort(q + 1, q + n + 1);
  for (int i = 1, l = 0, r = 0; i <= n; i++) {
    for (; l < q[i].l; s = (s * 2 % kM - C(l, r) + kM) % kM, l++);
    for (; l > q[i].l; l--, s = (s + C(l, r)) % kM * Inv % kM);
    for (; r < q[i].r; r++, s = (s + C(l, r)) % kM);
    for (; r > q[i].r; s = (s - C(l, r) + kM) % kM, r--);
    ans[q[i].id] = s * ((W(2LL, q[i].l + 1, kM) - 1 + kM) % kM) % kM;
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << '\n';
}