#include<bits/stdc++.h>
#define rep(k,l,r) for(int k=l;k<=r;++k)
#define per(k,r,l) for(int k=r;k>=l;--k)
#define int long long
#define cl(f,x) memset(f,x,sizeof(f))
using namespace std;
const int N=20,M=2e2+5;
int f[N][M],t[N];
int dfs(int x,int S,bool limit) {
	if(!limit&&f[x][S]!=-1)
		return f[x][S];
	if(!x)
		return S==0;
	if(x*9<S)
		return 0;
	int up=min(limit? t[x]:9ll,S),res=0;
	rep(d,0,up)
		res+=dfs(x-1,S-d,limit&&d==t[x]);
	if(!limit)
		f[x][S]=res;
	return res;
}
int g[N][M][M];
int dfs1(int x,int S,int T,bool limit,bool lead) {
	if(!limit&&!lead&&g[x][S][T]!=-1)
		return g[x][S][T];
	if(!x)
		return T==0;
	if(x*9<T)
		return 0;
	int up=min(limit? t[x]:9ll,T),res=0;
	rep(d,0,up) {
		if(S-(T-d)>S/2) {
			if(abs((S-T)-T)>=abs((S-(T-d))-(T-d)))
				res+=abs((S-(T-d))-(T-d))*dfs(x-1,T-d,limit&&d==t[x]);
			else
				res+=abs((S-T)-T)*dfs(x-1,T-d,limit&&d==t[x]);
		} else
			res+=dfs1(x-1,S,T-d,limit&&d==t[x],lead&&!d);
	}
	if(!limit&&!lead)
		g[x][S][T]=res;
	return res;
}
int calc(int x) {
	int len=0;
	while(x)
		t[++len]=x%10,x/=10;
	int res=0;
	rep(i,1,len*9)
		res+=dfs1(len,i,i,true,true);
	return res;
}
void solve() {
	int l,r;
	scanf("%lld%lld",&l,&r);
	printf("%lld\n",calc(r)-calc(l-1));
}
signed main() {	
	// freopen("H.in","r",stdin);
	// freopen("H.out","w",stdout);
	cl(f,-1);
	cl(g,-1);
	int testcase=1;
	scanf("%lld",&testcase);
	while(testcase--)
		solve();
	// cout<<1000*clock()/CLOCKS_PER_SEC<<"\n";
	return 0;
}