#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
#define div _div
void die(string S){puts(S.c_str());exit(0);}
const ll mod=1e9+7;
ll inve[20];
inline ll inv(ll a)
{
if(a<20)return inve[a];
return mod-inve[mod-a];
}
ll pw10[19];
ll interpolate(vector<ll> vx,vector<ll> vy,ll X)
{
	ll ans=0;
	for(int i=0;i<sz(vx);i++)
	{
		for(int j=0;j<sz(vx);j++) if(i!=j)
			vy[i]=vy[i]*(X%mod-vx[j]%mod+mod)%mod*inv((vx[i]-vx[j]+mod)%mod)%mod;
		ans=(ans+vy[i])%mod;
	}
	return ans;
}
inline ll div(ll a,ll b)
{
	if(a>=0) return a/b;
	return -((-a+b-1)/b);
}
ll calc1(int b,int c,ll Lx,ll Rx,ll Ly,ll Ry)
{
	int a=17-b;
	/*
		Limit 0: y >= x - c*10^b + 1
		Cmp 0: x - c*10^b + 1 (?) Ly
		Limit 1: y <= 10x + c
		Cmp 1: 10x + c (?) Ry
		Limit 2: y <= [ 11x - c*(10^b-1) ] /2
		- Notice that now the cost is (c*10^k + y - x)
		Cmp 2: [ 11x - c*(10^b-1) ] /2 (?) Ry
		Cmp 3: [ 11x - c*(10^b-1) ] /2 (?) 10x + c
	*/
	ll ans=0;
	for(int state=0;state<8;state++)
	{
		ll nLx=Lx,nRx=Rx;
		if(state&1) // Cmp 0: >=
			nLx=max(nLx,c*pw10[b]+Ly-1);
		else // Cmp 0: <
			nRx=min(nRx,Ly+c*pw10[b]-2);
		if(state&2) // Cmp 1: >=
			nLx=max(nLx,div((Ry-c+9),10));
		else // Cmp 1: <
			nRx=min(nRx,div((Ry-c-1),10));
		if(state&4) // Cmp 2: >=
			nLx=max(nLx,div((Ry*2+c*(pw10[b]-1)+10),11));
		else // Cmp 2: <
			nRx=min(nRx,div((Ry*2-1+c*(pw10[b]-1)),11));
		function<ll(ll)> calc=[&](ll x)
		{
			ll nLy=Ly,nRy=Ry;
			nRy=min(nRy,div((11*x-c*(pw10[b]-1)),2));
			nRy=min(nRy,10*x+c);
			nLy=max(nLy,x-c*pw10[b]+1);
			if(nLy>nRy) return 0ll;
			ll Cnt=max(0ll,nRy-nLy+1)%mod;
			ll Cost=(Cnt*(c*pw10[b]%mod-x%mod+mod)%mod+(nRy+nLy)%mod*Cnt%mod*(mod+1)/2)%mod;
			return Cost;
		};
		if(nLx>nRx) continue;
		for(int j=0;j<2;j++)
		{
			ll Lx2=nLx;
			ll Rx2=nRx;
			while(Lx2%2!=j&&Lx2<=Rx2) Lx2++;
			while(Rx2%2!=j&&Lx2<=Rx2) Rx2--;
			if(Lx2>Rx2) continue;
			ll V1=calc(Lx2);
			ll V2=calc(Rx2);
			if(!V1&&!V2) continue;
			if(!V1)
			{
				ll l=div(Lx2,2),r=div(Rx2,2);
				while(l<r)
				{
					ll mid=(l+r)/2;
					ll Mid=mid*2+j;
					if(!calc(Mid))
						l=mid+1;
					else
						r=mid;
				}
				Lx2=l*2+j;
			}
			if(!V2)
			{
				ll l=div(Lx2,2),r=div(Rx2,2);
				while(l<r)
				{
					ll mid=(l+r+1)/2;
					ll Mid=mid*2+j;
					if(!calc(Mid))
						r=mid-1;
					else
						l=mid;
				}
				Rx2=l*2+j;
			}
			if(Lx2>Rx2) continue;
			if(Rx2-Lx2<=10)
			{
				for(ll val=Lx2;val<=Rx2;val+=2)
					ans=(ans+calc(val))%mod;
			}
			else
			{
				vector<ll> vx(4),vy(4);
				for(int i=0;i<=3;i++)
					vx[i]=Lx2+i*2;
				for(int i=0;i<=3;i++)
					vy[i]=calc(vx[i]);
				for(int i=1;i<=3;i++)
					vy[i]=(vy[i]+vy[i-1])%mod;
				ans=(ans+interpolate(vx,vy,Rx2));
			}
		}
	}
	return ans;
}
ll calc2(int b,int c,ll Lx,ll Rx,ll Ly,ll Ry)
{
	int a=17-b;
	/*
		Limit 0: y >= x - c*10^b + 1
		Cmp 0: x - c*10^b + 1 (?) Ly
		Limit 1: y <= 10x + c
		Cmp 1: 10x + c (?) Ry
		Limit 2: y >= [ 11x - c*(10^b-1) ] /2 + 1
		- Notice that now the cost is (10x + c - y)
		Cmp 2: [ 11x - c*(10^b-1) ] /2 + 1 (?) Ly
		Cmp 3: [ 11x - c*(10^b-1) ] /2 + 1 (?) x - c*10^b + 1
	*/
	ll ans=0;
	for(int state=0;state<8;state++)
	{
		ll nLx=Lx,nRx=Rx;
		if(state&1) // Cmp 0: >=
			nLx=max(nLx,c*pw10[b]+Ly-1);
		else // Cmp 0: <
			nRx=min(nRx,Ly+c*pw10[b]-2);
		if(state&2) // Cmp 1: >=
			nLx=max(nLx,div((Ry-c+9),10));
		else // Cmp 1: <
			nRx=min(nRx,div((Ry-c-1),10));
		if(state&4) // Cmp 2: >=
			nLx=max(nLx,div((Ly*2-2+c*(pw10[b]-1)+10),11));
		else // Cmp 2: <
			nRx=min(nRx,div((Ly*2-3+c*(pw10[b]-1)),11));
		function<ll(ll)> calc=[&](ll x)
		{
			ll nLy=Ly,nRy=Ry;
			nLy=max(nLy,div((11*x-c*(pw10[b]-1)),2)+1);
			nRy=min(nRy,10*x+c);
			nLy=max(nLy,x-c*pw10[b]+1);
			if(nLy>nRy) return 0ll;
			ll Cnt=max(0ll,nRy-nLy+1)%mod;
			ll Cost=(Cnt*((10*x%mod+c)%mod)%mod-(nRy+nLy)%mod*Cnt%mod*(mod+1)/2%mod+mod)%mod;
			return Cost;
		};
		if(nLx>nRx) continue;
		for(int j=0;j<2;j++)
		{
			ll Lx2=nLx;
			ll Rx2=nRx;
			while(Lx2%2!=j&&Lx2<=Rx2) Lx2++;
			while(Rx2%2!=j&&Lx2<=Rx2) Rx2--;
			if(Lx2>Rx2) continue;
			ll V1=calc(Lx2);
			ll V2=calc(Rx2);
			if(!V1&&!V2) continue;
			if(!V1)
			{
				ll l=div(Lx2,2),r=div(Rx2,2);
				while(l<r)
				{
					ll mid=(l+r)/2;
					ll Mid=mid*2+j;
					if(!calc(Mid))
						l=mid+1;
					else
						r=mid;
				}
				Lx2=l*2+j;
			}
			if(!V2)
			{
				ll l=div(Lx2,2),r=div(Rx2,2);
				while(l<r)
				{
					ll mid=(l+r+1)/2;
					ll Mid=mid*2+j;
					if(!calc(Mid))
						r=mid-1;
					else
						l=mid;
				}
				Rx2=l*2+j;
			}
			if(Lx2>Rx2) continue;
			if(Rx2-Lx2<=10)
			{
				for(ll val=Lx2;val<=Rx2;val+=2)
					ans=(ans+calc(val))%mod;
			}
			else
			{
				vector<ll> vx(4),vy(4);
				for(int i=0;i<=3;i++)
					vx[i]=Lx2+i*2;
				for(int i=0;i<=3;i++)
					vy[i]=calc(vx[i]);
				for(int i=1;i<=3;i++)
					vy[i]=(vy[i]+vy[i-1])%mod;
				ans=(ans+interpolate(vx,vy,Rx2));
			}
		}
	}
	return ans;
}
ll calc(int b,int c,ll Lx,ll Rx,ll Ly,ll Ry)
{
	if(Lx>Rx||Ly>Ry) return 0;
	ll res=(calc1(b,c,Lx,Rx,Ly,Ry)+calc2(b,c,Lx,Rx,Ly,Ry))%mod;
	return res;
}
ll f(ll lim)
{
	if(!lim) return 0;
	if(lim==1000000000000000000ll) return (f(lim-1)+1)%mod;
	ll res=0;
	for(int b=0;b<18;b++) for(int c=0;c<10;c++)
	{
		int a=17-b;
		res=(res+calc(b,c,0,lim/pw10[b+1]-1,0,pw10[b]-1))%mod;
		if(c*pw10[b]<=lim%pw10[b+1])
			res=(res+calc(b,c,lim/pw10[b+1],lim/pw10[b+1],0,min((lim%pw10[b+1]-c*pw10[b]),pw10[b]-1)))%mod;
	}
	return res;
}
ll to_int(string s)
{
	ll res=0;
	for(auto ch:s)
		res=(res*10+(ch^48));
	return res;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
inve[1]=1;
for(int i=2;i<20;i++) inve[i]=(mod-mod/i)*inve[mod%i]%mod;
	pw10[0]=1;
	for(int i=1;i<19;i++)
		pw10[i]=pw10[i-1]*10;
	int t;
	cin>>t;
	while(t--)
	{
		ll l,r;
		cin>>l>>r;
		cout<<(f(r)-f(l-1)+mod)%mod<<'\n';
	}
	return 0;
}