#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

long long T, k, tot, ans[200005], fac[200005], inv[200005], mod = 998244353;

struct node {
	long long l, r, id;
}p[200005];

long long ksm(long long x, long long y) {
	long long ans = 1;
	while(y) {
		if(y & 1) ans = ans * x % mod;
		x = x * x % mod, y >>= 1; 
	}
	return ans;
}

long long C(long long x, long long y) {
	if(x < y) return 0;
	return fac[x] * inv[y] % mod * inv[x - y] % mod;
}

bool cmp(node p, node q) {
	if((p.l - 1) / k == (q.l - 1) / k) return ((q.l - 1) / k + 1) & 1 ? p.r < q.r : p.r > q.r;
	return (p.l - 1) / k < (q.l - 1) / k;
}

void addl(long long x, long long y) {
	tot = ((tot * 2 % mod - C(x, y)) % mod + mod) % mod;
}

void addr(long long x, long long y) {
	tot = (tot + C(x, y + 1)) % mod;
}

void minl(long long x, long long y) {
	tot = (tot + C(x - 1, y)) % mod * ((mod + 1) / 2) % mod;
}

void minr(long long x, long long y) {
	tot = ((tot - C(x, y)) % mod + mod) % mod;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	fac[0] = 1;
	for(long long i = 1; i <= 200000; i++) fac[i] = fac[i - 1] * i % mod;
	inv[200000] = ksm(fac[200000], mod - 2);
	for(long long i = 199999; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
	cin >> T;
	k = sqrt(T);
	for(long long i = 1; i <= T; i++) {
		cin >> p[i].l >> p[i].r;
		p[i].id = i;
	}
	sort(p + 1, p + T + 1, cmp);
	long long x = 0, y = 0;
	tot = 1;
	for(long long i = 1; i <= T; i++) {
		ans[p[i].id] = ksm(2, p[i].l) - 1;
		p[i].l--, p[i].r--;
		while(x < p[i].l) addl(x, y), x++;
		while(y < p[i].r) addr(x, y), y++;
		while(x > p[i].l) minl(x, y), x--;
		while(y > p[i].r) minr(x, y), y--;
		ans[p[i].id] = ans[p[i].id] * tot % mod;
	}
	for(long long i = 1; i <= T; i++) cout << ans[i] << endl;
}