A - Beautiful numbers

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

     using namespace std;

     #define LL long long
     const int MOD = ;
     LL dp[][][];
     int a[];
     int Hash[];

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

     LL dfs(int pos, int num, int lcm, bool limit)
     {
         if(-==pos) return num%lcm == ;
         if(!limit && ~dp[pos][Hash[lcm]][num]) return dp[pos][Hash[lcm]][num];
         LL ans = ;
         int end = limit?a[pos]:;
         for(int i=; i<=end; i++)
             ans += dfs(pos-, (num*+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 = ;
         while(n)
         {
             a[pos++] = n%;
             n /= ;
         }
         return dfs(pos-, , , );
     }

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