#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define int128 __int128_t
#define pii128 pair<int128,int128>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-10;
const db pi = acos(-1);
template<class T> bool chmin(T& x, T y){
    if(x > y) {
        x = y;
        return true;
    } else return false;
}
template<class T> bool chmax(T& x, T y){
    if(x < y) {
        x = y;
        return true;
    } else return false;
}

// overload macro
#define CAT( A, B ) A ## B
#define SELECT( NAME, NUM ) CAT( NAME, NUM )

#define GET_COUNT( _1, _2, _3, _4, _5, _6 /* ad nauseam */, COUNT, ... ) COUNT
#define VA_SIZE( ... ) GET_COUNT( __VA_ARGS__, 6, 5, 4, 3, 2, 1 )

#define VA_SELECT( NAME, ... ) SELECT( NAME, VA_SIZE(__VA_ARGS__) )(__VA_ARGS__)

// rep(overload)
#define rep( ... ) VA_SELECT(rep, __VA_ARGS__)
#define rep2(i, n) for (int i = 0; i < int(n); i++)
#define rep3(i, a, b) for (int i = a; i < int(b); i++)
#define rep4(i, a, b, c) for (int i = a; i < int(b); i += c)

// repll(overload)
#define repll( ... ) VA_SELECT(repll, __VA_ARGS__)
#define repll2(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repll3(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define repll4(i, a, b, c) for (ll i = a; i < (ll)(b); i += c)

// rrep(overload)
#define rrep( ... ) VA_SELECT(rrep, __VA_ARGS__)    
#define rrep2(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep3(i, a, b) for (int i = b - 1; i >= a; i--)
#define rrep4(i, a, b, c) for (int i = b - 1; i >= a; i -= c)

// rrepll(overload)
#define rrepll( ... ) VA_SELECT(rrepll, __VA_ARGS__)
#define rrepll2(i, n) for (ll i = (ll)(n) - 1; i >= 0ll; i--)
#define rrepll3(i, a, b) for (ll i = b - 1; i >= (ll)(a); i--)
#define rrepll4(i, a, b, c) for (ll i = b - 1; i >= (ll)(a); i -= c)

// for_earh
#define fore(e, v) for (auto&& e : v)

// vector
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

#include<atcoder/all>
using namespace atcoder;

using mint = modint998244353;

ostream &operator << (ostream& lhs, const mint& rhs) {
    lhs << rhs.val();
    return lhs;
}

istream &operator >> (istream& lhs, mint& rhs) {
    long long a;
    lhs >> a;
    rhs += a;
    return lhs;
}

mint modpow(mint x, long long y) {
    if (y == 0) return 1;
    return modpow(x * x, y / 2) * (y & 1 ? x : 1);
}

struct node {
    int b, d, l;
    node(int x, int y, int z) : b(x), d(y), l(z) {}
};

bool operator>(const node& x, const node& y) {
    long double lhs = (long double)(x.d * (y.b - 1)) / (y.d * (x.b - 1));
    int mnl = min(x.l, y.l);
    long double s = powl((long double)y.b / x.b, mnl) * powl(y.b, y.l - mnl) - (long double)1 / powl(x.b, mnl);
    long double m = powl(x.b, x.l - mnl) - (long double)1 / powl(x.b, mnl);
    return lhs > s / m;
}

mint sum[1000010];
int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    priority_queue<node, vector<node>, greater<node>> pq;
    rep (b, 2, 17) rep (d, 1, b) {
        pq.push(node{b, d, 1});
    }

    int idx = 0;
    while (idx <= 1000005) {
        auto [b, d, l] = pq.top(); pq.pop();
        sum[idx + 1] += sum[idx];
        sum[idx + 1] += (mint)((modpow(b, l) - 1) * d) / (b - 1);
        pq.push({b, d, l + 1});
        idx++;
    }


    int t;
    cin >> t;
    rep (i, t) {
        int l, r;
        cin >> l >> r;
        cout << sum[r] - sum[l - 1] << '\n';
    }
}

answer.code:70:9: fatal error: atcoder/all: No such file or directory
   70 | #include<atcoder/all>
      |         ^~~~~~~~~~~~~
compilation terminated.