#include<bits/stdc++.h>
using namespace std;
#define il inline
#define fi first
#define se second
#define mk make_pair
#define eb emplace_back
#define rep(i,l,r) for(int i=(l); i<=(r); ++i)
#define rep_(i,l,r) for(int i=(l); i>=(r); --i)
typedef long long lr;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
constexpr int mod1=998244353,mod2=1e9+7;
constexpr db pi=3.141592653589793,eps=1e-9;
constexpr int inf32=0x3f3f3f3f,Inf32=0xc0c0c0c0;
constexpr lr inf64=0x3f3f3f3f3f3f3f3f,Inf64=0xc0c0c0c0c0c0c0c0;
template<typename T>il T Max(T x,T y) { return (x>y)? x:y; }
template<typename T>il T Min(T x,T y) { return (x<y)? x:y; }
template<typename T>il T gcd(T x,T y) { return (!y)? x:gcd(y,x%y); }
template<typename T>il T Abs(T x) { return (x>0)? x:(-x); }
template<typename T>il T Rnd(T l,T r,mt19937_64 &eng)
{
	uniform_int_distribution<T> uid(l,r);
	return uid(eng);
}
mt19937_64 eng(chrono::high_resolution_clock::now().time_since_epoch().count());
constexpr int N=524300;
lr l,r,pw[21],b[21],pre[21][180][10][2],suf[21][180][10][3],suf2[21][180][10];
il lr calc(lr x)
{
	rep(i,1,19)
		b[i]=(x/pw[i-1])%10;
	memset(pre,0,sizeof(pre));
	memset(suf,0,sizeof(suf));
	memset(suf2,0,sizeof(suf2));
	pre[20][0][0][0]=1;
	rep_(i,19,1)
		rep(j,0,(20-i)*9)
			rep(k,0,9)
				rep(p,0,1)
				{
					int lim=(!p)? b[i]:9;
					rep(q,0,lim)
					{
						if(q>j)
							continue;
						int kk=(q)? q:k,pp=(p||(q<b[i]));
						pre[i][j][kk][pp]+=pre[i+1][j-q][k][p];
					}
				}
	suf[0][0][0][0]=1;
	rep(i,1,19)
		rep(j,0,i*9)
			rep(k,0,9)
				rep(p,0,2)
					rep(q,0,9)
					{
						if(q>j)
							continue;
						int kk=q,pp=p;
						if(q<b[i]) pp=1;
						if(q>b[i]) pp=2;
						suf[i][j][kk][pp]+=suf[i-1][j-q][k][p];
					}
	suf2[0][0][0]=1;
	rep(i,1,19)
		rep(j,0,i*9)
			rep(k,0,9)
				rep(q,0,9)
				{
					if(q>j)
						continue;
					int kk=q;
					suf2[i][j][kk]+=suf2[i-1][j-q][k];
				}
	lr ans=0;
	rep(i,1,18)
	{
		int lft=19-i,rgt=i;
		rep(j,1,lft*9)
			rep(k,0,rgt*9)
			{
				if(Abs(j-k)>9)
					continue;
				rep(jj,1,9)
					rep(kk,0,9)
					{
						if(!kk&&rgt>1)
							continue;
						if(j<jj||k<kk||(lft>1&&Abs(j-k-(jj<<1))<Abs(j-k))||(rgt>1&&Abs(j-k+(kk<<1))<=Abs(j-k)))
							continue;
						lr ansl,ansr,anss=0;
						ansl=pre[i+1][j][jj][0],ansr=suf[i][k][kk][0];
						anss+=ansl*ansr;
						ansl=pre[i+1][j][jj][0],ansr=suf[i][k][kk][1];
						anss+=ansl*ansr;
						ansl=pre[i+1][j][jj][1],ansr=suf2[i][k][kk];
						anss+=ansl*ansr;
						// if(anss)
						// 	cout<<"19 ~ "<<i+1<<" , "<<j<<" , "<<jj<<" ; ",
						// 	cout<<i<<" ~ 1 , "<<k<<" , "<<kk<<" . "<<anss<<'\n';
						ans+=anss*Abs(j-k);
					}
			}
	}
	return ans;
}
il void Solve()
{
	cin>>l>>r;
	pw[0]=1;
	rep(i,1,18)
		pw[i]=pw[i-1]*10;
	cout<<calc(r)-calc(l-1)<<'\n';
}
int main()
{
#ifdef LOCAL
	string fpre="test",isuf="in",osuf="out";
	assert(freopen((fpre+"."+isuf).c_str(),"r",stdin));
	assert(freopen((fpre+"."+osuf).c_str(),"w",stdout));
#endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;
	cin>>T;
	while(T--)
		Solve();
	return 0;
}