#include<bits/stdc++.h>

using namespace std;
const int maxn = 21;
typedef long long ll;
ll dp[maxn][2*maxn][maxn];
int num[11] = {1,0,0,0,1,0,1,0,2,1};
int bit[maxn],n;
ll dfs(int pos,int sum,int now,int fz,int flag)
{
    if(pos <= 0) return sum;
    if(flag && dp[pos][sum][now] != -1)
        return dp[pos][sum][now];
    int up = flag ? 9 : bit[pos];
    ll ans = 0;
    for(int i = 0;i <= up;++i)
    {
        if(fz == 0)
        {
            if(i == 0)
                ans += dfs(pos-1,0,10,0,flag || i != up);
            else
                ans += dfs(pos-1,num[i],i,1,flag || i != up);
        }
        else
           ans += dfs(pos-1,sum+num[i],now,1,flag || i != up);
    }
    if(flag)
        dp[pos][sum][now] = ans;
    return ans;

}
ll solve(int x)
{
    if(x <= 0) return 0;
    int len = 0;
    while(x)
    {
        bit[++len] = x % 10;
        x /= 10;
    }
    return dfs(len,0,10,0,0);
}
int main()
{
    ll a,b;
    int _;
    cin >> _;
    memset(dp,-1,sizeof dp);
    while(_--)
    {
        scanf("%lld %lld",&a,&b);
        ll ans = solve(b) - solve(a-1);
        if(a == 0)
            ans++;
        printf("%lld\n",ans);
    }
    return 0;
}