//http://poj.org/problem?id=3252

#include<cstdio>

#include<cstring>

using namespace std;

int b[];

int dp[][][];

int dfs(int pos,int preok,int more,int pre0)

{

    if (pos==-) return more==?:;

    if (preok && dp[pos][more+][pre0]!=-) return dp[pos][more+][pre0];

    int up=preok?:b[pos];

    int ans=;

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

    {

        if (i<b[pos]||preok) ans+=dfs(pos-,,more+(i==?:pre0-),pre0&&!i);

        else ans+=dfs(pos-,,more+(i==?:pre0-),pre0&&!i);

    }

    if (preok) dp[pos][more+][pre0]=ans;

    //printf("pos=%d preok=%d more=%d pre0=%d ans=%d\n",pos,preok,more,pre0,ans);

    return ans;

}

int solve(int n)

{

    if (n<) return ;

    int cnt=;

    int now=n;

    do{

        b[cnt]=now%;

        now/=;

        cnt++;

    }while (now);

    int ans=;

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

        ans+=dfs(cnt-,,i,);

    return ans;

}

int main()

{

    int n,m;

    memset(dp,-,sizeof(dp));

    while (~scanf("%d%d",&n,&m))

    {

        printf("%d\n",solve(m)-solve(n-));

    }

    return ;

}