#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<string>

#define N 100005
#define M 10005
//#define mod 10000007
//#define p 10000007
#define mod2 1000000000
#define ll long long
#define ull unsigned long long
#define LL long long
#define eps 1e-6
//#define inf 2147483647
#define maxi(a,b) (a)>(b)? (a) : (b)
#define mini(a,b) (a)<(b)? (a) : (b)

using namespace std;

int T;
ll l,r;
ll ans;

void ini()
{
    scanf("%I64d%I64d",&l,&r);
    ans=0;
}

void dfs(ll v,ll last)
{
    if(v>r){
        return;
    }
    if(v>=l){
        ans++;
    }
    ll i;
    v*=10;
    for(i=1;i<=last;i++){
        if(last%i==0){
            dfs(v+i,i);
        }
    }
}

void solve()
{
    ll i;
    for(i=1;i<=9;i++){
        dfs(i,i);
    }
}

void out()
{
    printf("%I64d\n",ans);
}

int main()
{
    //freopen("data.in","r",stdin);
    //freopen("data.out","w",stdout);
    scanf("%d",&T);
    //for(int ccnt=1;ccnt<=T;ccnt++)
    while(T--)
    //scanf("%d%d",&n,&m);
   // while(scanf("%I64d%I64d",&a,&b)!=EOF)
    {
        ini();
        solve();
        out();
    }
    return 0;
}