A

    #include <iostream>
    #include <algorithm>
    #include <cstring>
    #include <cstdio>
    #include <cstdlib>
    #include <vector>

    using namespace std;

    #define LL long long
    const int MOD = 2520;
    LL dp[20][50][2550];
    int a[20];
    int Hash[2550];

    LL gcd(LL a, LL b)
    {
        return b?gcd(b,a%b):a;
    }

    LL dfs(int pos, int num, int lcm, bool limit)
    {
        if(-1==pos) return num%lcm == 0;
        if(!limit && ~dp[pos][Hash[lcm]][num]) return dp[pos][Hash[lcm]][num];
        LL ans = 0;
        int end = limit?a[pos]:9;
        for(int i=0; i<=end; i++)
            ans += dfs(pos-1, (num*10+i)%MOD, i?lcm*i/gcd(lcm,i):lcm, limit&&i==a[pos]);
        if(!limit) dp[pos][Hash[lcm]][num] = ans;
        return ans;
    }

    LL solve(LL n)
    {
        int pos = 0;
        while(n)
        {
            a[pos++] = n%10;
            n /= 10;
        }
        return dfs(pos-1, 0, 1, 1);
    }

    int main()
    {
        int T;
        scanf("%d", &T);
        int cnt = 0;
        for(int i=1; i<=MOD; i++)
            if(MOD%i == 0)
                Hash[i] = cnt++;
        memset(dp, -1, sizeof(dp));
        while(T--)
        {
            long long l, r;
            scanf("%lld%lld", &l, &r);
            printf("%lld
", solve(r)-solve(l-1));
        }
        return 0;
    }