#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define yu (998244353)
inline ll ksm(ll x,ll y=yu-2){
    ll an=1;for(;y;y>>=1){
        if(y&1)an=an*x%yu;
        x=x*x%yu;
    }return an;
}
inline void add(ll &x,ll y){x+=y;if(x>=yu)x-=yu;return ;}
#define N 21
#define B 11
struct node{
    ll x,y;
    node(ll a=0,ll b=0){x=a;y=b;return ;}
}g[N][N][N*B][B][N];
ll rc[N][N][N*B][B][N],gs[N][N][N*B][B][N];
node operator+(node x,node y){add(x.x,y.x);add(x.y,y.y);return x;} 
node operator*(node x,ll y){return node(x.x*y%yu,x.y*y%yu);}
inline ll gt(node x,ll y){return (y%yu*x.x+x.y)%yu;}
inline ll hs(ll x){ll g=0;while(x)g++,x/=10;return g;}
inline ll sum(ll x){ll s=0;while(x)s+=x%10,x/=10;return s;}
ll pw[N];
inline void solve(ll k,ll l,ll s,ll u,ll y){
    if(rc[k][l][s][u][y/9]!=-1)return ;
    ll &o=rc[k][l][s][u][y/9],&p=gs[k][l][s][u][y/9];node &q=g[k][l][s][u][y/9];o=0;
    if(k==3){
        ll tem=u*1000+1000-y;
        if(l<=1){
            while(tem>0){
                ll tt=sum(tem);q=(q*ksm(10,hs(tem))+node(ksm(10,k),tem));
                o+=tt;p+=hs(tem);tem-=tt;
            }return ;
        }while(tem>=0){
            ll tt=sum(tem)+s;q=(q*ksm(10,l+k)+node(ksm(10,k),tem));
            o+=tt;p+=l+k;tem-=tt;
        }return ;
    }solve(k-1,l+1,s+u,9,y);
    ll e=rc[k-1][l+1][s+u][9][y/9],t=gs[k-1][l+1][s+u][9][y/9];node c=g[k-1][l+1][s+u][9][y/9];
    o=e;p=t;q.x=c.x*10%yu;q.y=(c.y+u*10*c.x)%yu;
    if(!u)return ;
    ll ny=e+y-pw[k];
	if(u-1==0&&l==1)l--;
	solve(k,l,s,u-1,ny);
    o+=rc[k][l][s][u-1][ny/9];p+=gs[k][l][s][u-1][ny/9];q=(q*ksm(10,gs[k][l][s][u-1][ny/9])+g[k][l][s][u-1][ny/9]);
    return ;
}
ll an=0;
inline void gt(ll &x){
    ll s=0,g=0,nw=x;while(nw){
        g++;s+=nw%10;nw/=10;
    }an=an*ksm(10,g)%yu;an=(an+x)%yu;x-=s;return ;
}unordered_map<ll,ll>ji;
inline ll suan(ll x){
	if(ji.find(x)!=ji.end())return ji[x];
    an=0;while(x>0&&(x%9!=0||(x%1000)<1000-18*9))gt(x);
    ll k=3,bas=1000,n=x,y=bas-x%bas;x=(x/bas);while(n){
        solve(k,hs(x),sum(x)-x%10,x%10,y);
        n-=rc[k][hs(x)][sum(x)-x%10][x%10][y/9];
        an=(an*ksm(10,gs[k][hs(x)][sum(x)-x%10][x%10][y/9])+gt(g[k][hs(x)][sum(x)-x%10][x%10][y/9],x-x%10))%yu;
        k++;bas=bas*10;x=n/bas;y=bas-n%bas;
    }return ji[x]=an;
}
int main(){
//	freopen("test1.in","r",stdin);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll ti;cin>>ti;memset(rc,-1,sizeof(rc));pw[0]=1;for(int i=1;i<=18;i++)pw[i]=pw[i-1]*10;
    while(ti--){
        ll l,r;cin>>l>>r;ll ans=0;for(ll i=l;i<=r;i++)add(ans,suan(i));
        cout<<ans<<'\n';
    }return 0;
}