1 #include<bits/stdc++.h>
 2 using namespace std;
 3 #define lson l,mid,rt<<1
 4 #define rson mid+1,r,rt<<1|1
 5 #define sqr(x) ((x)*(x))
 6 #define pb push_back
 7 #define eb emplace_back
 8 #define maxn 13000005
 9 #define eps 1e-8
10 #define pi acos(-1.0)
11 #define rep(k,i,j) for(int k=i;k<j;k++)
12 typedef long long ll;
13 typedef pair<int,int> pii;
14 typedef pair<long long,int>pli;
15 typedef pair<int,char> pic;
16 typedef pair<pair<int,string>,pii> ppp;
17 typedef unsigned long long ull;
18 const long long MOD=1e9+7;
19 /*#ifndef ONLINE_JUDGE
20         freopen("1.txt","r",stdin);
21 #endif */
22 
23 ll dp[25][60005];
24 int a[25];
25 int k;
26 
27 bool Check(int x){
28     int num[10];
29     for(int i=0;i<10;i++){
30         num[i]=x%3;
31         x/=3;
32     }
33     for(int i=0;i<10;i++){
34         if(num[i]==1&&(i%2)){
35             return false;
36         }
37         if(num[i]==2&&(i%2==0)){
38             return false;
39         }
40     }
41     return true;
42 }
43 
44 int Change(int x,int v){
45     int num[10];
46     for(int i=0;i<10;i++){
47         num[i]=x%3;
48         x/=3;
49     }
50     if(num[v]==1) num[v]=2;
51     else if(num[v]==2||num[v]==0) num[v]=1;
52     x=0;
53     for(int i=9;i>=0;i--){
54         x=x*3+num[i];
55     }
56     return x;
57 }
58 
59 ll dfs(int pos,int st,int lead,int limit){///要去掉前导0
60     if(pos==-1) return Check(st);
61     if(!limit&&dp[pos][st]!=-1) return dp[pos][st];
62     ll ans=0;
63     int up=limit?a[pos]:9;
64     for(int i=0;i<=up;i++){
65         ans+=dfs(pos-1,(lead==1&&i==0)?0:Change(st,i),lead&&i==0,limit&&i==a[pos]);
66     }
67     if(!limit) dp[pos][st]=ans;
68     return ans;
69 }
70 
71 ll solve(ll x){
72     int pos=0;
73     while(x){
74         a[pos++]=x%10;
75         x/=10;
76     }
77     ll ans=dfs(pos-1,0,1,1);
78     return ans;
79 }
80 
81 int main(){
82     #ifndef ONLINE_JUDGE
83      //   freopen("1.txt","r",stdin);
84     #endif
85     std::ios::sync_with_stdio(false);
86     int t;
87     ll n,m;
88     memset(dp,-1,sizeof(dp));
89     cin>>t;
90     for(int _=1;_<=t;_++){
91         cin>>n>>m;
92         ll ans=solve(m)-solve(n-1);
93         cout<<ans<<endl;
94     }
95 
96 }