求条，回复就关

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
int T;
int l,r;
int a[20],f[200][200][2];
int dfs(int x,int sum,bool up)
{
    if (!x) return sum;
    if (f[x][sum][up]!=-1) return f[x][sum][up];
    int bound=up?a[x]:9;
    int ans=0;
    for (int i=0;i<=bound;++i) ans=(ans+dfs(x-1,(sum+i)%mod,up&&i==bound))%mod;
    f[x][sum][up]=ans;
    return ans;
}
int solve(int x)
{
    int cnt=0;
    while(x)
    {
        a[++cnt]=x%10;
        x/=10;
    }
    return dfs(cnt,0,1)%mod;
}
signed main()
{ 
    ios::sync_with_stdio(0);
    cin>>T;
    while(T--)
    {
        memset(f,-1,sizeof(f));
        int l,r;
        cin>>l>>r;
        cout<<(solve(r)-solve(l-1)+mod)%mod<<"\n";
    }
    return 0;
}