#include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 int t;

 long long dp[][][];

 long long l, r;

 int shu[];

 long long dfs(int len,..., bool shangxian)

 {

     if (len == )

         return ...;

     if (!shangxian && dp[len][...])

         return dp[len][...];  //dp数组的内容应和dfs调用参数的内容相同，除了是否达到上限

     long long cnt = ;

     int maxx = (shangxian ? shu[len] : );

     for (int i = ; i <= maxx; i++)

     {

         ...;

         cnt += dfs(len - ,..., shangxian && i == maxx);

     }

     if (!shangxian)

         dp[len][...] = cnt;

     return cnt;

 }

 long long solve(long long x)

 {

     int k = ;

     while (x)

     {

         shu[++k] = x % ;

         x /= ;

     }

     return dfs(k,...,)

 }

 int main()

 {

         memset(dp, , sizeof(dp));

         scanf("%lld%lld", &l, &r);   //有些题目其实并不需要用到long long

         printf("%lld\n", solve(r) - solve(l - )); //只有满足区间减法才能用

     //while (1);

     return ;

 }