#include<bits/stdc++.h>
#define fi first
#define se second
#define LB lower_bound
using namespace std;using ll=long long;using pii=pair<int,int>;
const int N=1e6+5;
int n,m;
ll dp[180][19][180][11];
ll pw[20];
void init(){
	for(int i=pw[0]=1;i<=18;i++) pw[i]=pw[i-1]*10;
	for(int x=0;x<=18*9;x++){
		dp[x][0][0][min(10,x)]=1;
		for(int i=1;i<=18;i++){
			for(int y=0;y<=x&&y<=i*9;y++){
				for(int z=0;z<=10;z++)if(dp[x][i-1][y][z]){
					for(int o=0;o<10;o++) if(o+y<=x){
						dp[x][i][y+o][min(z,abs(x-2*(y+o)))]+=dp[x][i-1][y][z];
					}
				}
			}
		}
	}
}
ll calc(ll x){
	x++;
	ll ans=0;
	for(int i=0;i<=18*9;i++){
		int sum=0,mi=min(i,10);
		for(int j=18;~j;j--){
			int y=x/pw[j]%10;
			for(int o=0;o<y;o++){
				int sumt=sum+o,mit=min(mi,abs(i-2*sumt));
				if(sumt>i) continue;
				for(int z=0;z<=10;z++) ans+=dp[i][j][i-sumt][z]*min(mit,z);
			}
			sum+=y;mi=min(mi,abs(i-2*sum));
		}
	}
	return ans;
}
void Solve(){
	ll l,r;scanf("%lld%lld",&l,&r);
	printf("%lld\n",calc(r)-calc(l-1));
}
int main(){
	init();
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}