#include <bits/stdc++.h>
using namespace std;

using ll = long long;
//#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

const int MOD=998244353;

struct Big: vector<signed> {
    static const int BASE = MOD;
#define me (*this)
    Big() {}
    Big(auto val) { while (val) pb(val % BASE), val /= BASE; }
    auto get(int i) const { return i < sz(me) ? me[i] : 0; }
    auto operator<=>(const Big& oth) const {
        for (int i = max(sz(me), sz(oth)) - 1; i >= 0; i--)
            if (auto res = me.get(i) <=> oth.get(i); res != 0) return res;
        return 0 <=> 0;
    }
    Big& operator+=(const Big& oth) {
        for (int i = 0, r = 0; i < sz(oth) || r; i++) {
            if (i == size()) pb(0);
            me[i] += r + oth.get(i);
            if (r = me[i] >= BASE) me[i] -= BASE;
        }
        return me;
    }
    Big& operator*=(int oth) {
        for (int i = 0, r = 0; i < sz(me) || r; i++) {
            if (i == size()) pb(0);
            ll cur = me[i] * ll(oth) + r;
            me[i] = cur % BASE;
            r = cur / BASE;
        }
        return me;
    }
};

struct Seq
{
    int base,dig;
    Big num;
    Seq(int base,int dig):base(base),dig(dig),num{dig} {}
    void next()
    {
        num*=base;
        num+=dig;
    }
    friend bool operator<(const Seq&x,const Seq&y)
    {
        return x.num>y.num;
    }
};

const int N=1e6+100;

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    priority_queue<Seq> pq;
    for(int base=2;base<=16;base++)
        for(int dig=1;dig<base;dig++)
            pq.emplace(base,dig);

    vector<int> nums{0};
    Big prv;
    while(nums.size()<=N)
    {
        Seq cur=pq.top();
        pq.pop();
        if(cur.num!=prv)
            prv=cur.num,
                    nums.pb({prv.front()});
        cur.next();
        pq.push(cur);
    }
    for(int i=1;i<sz(nums);i++)
        (nums[i]+=nums[i-1])%=MOD;
    int t;
    cin>>t;
    while(t--)
    {
        int l,r;
        cin>>l>>r;
        cout<<(nums[r]-nums[l-1]+MOD)%MOD<<"\n";
    }
}