#include <bits/stdc++.h>

#define F first
#define S second
#define all(x) x.begin(), x.end()

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pii;

const ll N = 2e5 + 7, mod = 998244353, inf = 1e18;

vector <ll> arr;
ll rp[50], cnt[50][50], sum[50][50];

ll Pow(ll x, ll y) {
	ll res = 1, pot = x;
	while (y) {
		if (y % 2) res = res * pot % mod;
		pot = pot * pot % mod;
		y /= 2;
	}
	return res;
}

ll Sum(ll r, int x, int k, ll su = 0) {
	if (!x || !r || !k) return 0;
	ll y = arr[x];
	if (r >= y) return (cnt[x][k]%mod*su + sum[x][k] + Sum(r-y, x-1, k-1, (su+y)%mod))%mod;
	return Sum(r, x-1, k, su);
}

ll Cnt(ll r, int x, int k) {
	if (!x || !r || !k) return 0;
	ll y = arr[x];
	if (r >= y) return cnt[x][k] + Cnt(r-y, x-1, k-1);
	return Cnt(r, x-1, k);
}

int main() {
	arr = {0LL, 1LL, 2LL, 3LL, 5LL, 7LL, 13LL, 23LL, 43LL, 83LL, 163LL, 317LL, 631LL, 1259LL, 2503LL, 5003LL, 9973LL, 19937LL, 39869LL, 79699LL, 159389LL, 
	318751LL, 637499LL, 1274989LL, 2549951LL, 5099893LL, 10199767LL, 20399531LL, 40799041LL, 81598067LL, 163196129LL, 326392249LL, 652784471LL, 
	1305568919LL, 2611137817LL, 5222275627LL, 10444551233LL, 20889102457LL, 41778204911LL, 83556409789LL, 167112819547LL, 334225639093LL, 668451278147LL, inf};
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int siz = arr.size();
	for (int i = 1; i <= siz; i++) {
		rp[i] = Pow(i, mod-2);
		for (int j = 1; j <= siz; j++) {
			cnt[i][j] = (j == 1) + Cnt(arr[i]-1, i-1, j);
			sum[i][j] = (arr[i]*(j == 1) + Sum(arr[i]-1, i-1, j))%mod;
		}
	}
	
	int q; cin >> q;
	while (q--) {
		ll l, r; cin >> l >> r;
		ll sum = 0;
		int p1 = lower_bound(all(arr), l) - arr.begin()-1, p2 = lower_bound(all(arr), r) - arr.begin()-1;
		for (int i = 1; i <= siz; i++) {
			ll x = Sum(r, p2, i);
			x -= Sum(l-1, p1, i);
			sum += rp[i]*(x+mod)%mod;
		}
		cout << sum%mod << "\n";
	}
	
    return 0;
}