// BLuemoon_
#include <bits/stdc++.h>

using namespace std;
using LL = long long;

const int kMaxN = 2e5 + 5;
const LL kP = 998244353;

LL n, s, L, R, fa[kMaxN], cnt = 1, finv[kMaxN], F;

struct Q {
  LL l, r, id, ans;
  bool operator<(const Q& o) const {
    int lb = (l - 1) / s + 1, rb = (o.l - 1) / s + 1;
    return lb != rb ? lb < rb : (lb & 1 ? r < o.r : r > o.r);
  }
  bool operator>(const Q& o) const { return id < o.id; }
} q[kMaxN];

LL P(LL x, LL y, LL ret = 1) {
  for (; y; (y & 1) && ((ret *= x) %= kP), (x *= x) %= kP, y >>= 1) {
  }
  return ret;
}
LL C(LL p, LL k) { return (fa[p] * finv[k] % kP) * finv[p - k] % kP; }

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0), fa[0] = finv[0] = 1, F = P(2, kP - 2);
  for (int i = 1; i < kMaxN; i++) {
    fa[i] = fa[i - 1] * i % kP, finv[i] = P(fa[i], kP - 2);
  }
  cin >> n, s = sqrt(2e5);
  for (int i = 1; i <= n; i++) {
    cin >> q[i].l >> q[i].r, q[i].id = i, q[i].l--, q[i].r--;
  }
  sort(q + 1, q + n + 1);
  for (int i = 1; i <= n; i++) {
    for (; L < q[i].l; cnt = (cnt * 2 - C(L++, R) + kP) % kP) {
    }
    for (; R < q[i].r; cnt = (cnt + C(L, ++R)) % kP) {
    }
    for (; R > q[i].r; cnt = (cnt - C(L, R--) + kP) % kP) {
    }
    for (; L > q[i].l; cnt = ((cnt + C(--L, R)) % kP) * F % kP) {
    }
    q[i].ans = cnt * (P(2, L + 1) - 1) % kP;
  }
  sort(q + 1, q + n + 1, greater<Q>());
  for (int i = 1; i <= n; i++) {
    cout << q[i].ans << '\n';
  }
  return 0;
}