#include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<cmath>

 #include<map>

 #include<set>

 using namespace std;

 typedef long long ll;

 const int INF = 0x3f3f3f3f;

 const int maxn=+;

 int l,r;

 int dp[maxn][];

 int dig[];

 int dfs(int pos, int pre, int state, int limit)

 {

     if(pos==-)  return ;

     if(!limit && dp[pos][state]!=-)  return dp[pos][state];

     int up=limit?dig[pos]:;

     int tmp=;

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

     {

         if(i==) continue;

         if(pre== && i==)  continue;

         tmp+=dfs(pos-,i,i==,limit&&i==dig[pos]);

     }

     if(!limit)  dp[pos][state]=tmp;

     return tmp;

 }

 int solve(int x)

 {

     int pos=;

     while(x)

     {

         dig[pos++]=x%;

         x/=;

     }

     return dfs(pos-,-,,);

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

     while(~scanf("%d%d",&l,&r))

     {

         if(l== && r==)  break;

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

         int ans=solve(r)-solve(l-);

         cout<<ans<<endl;

     }

     return ;

 }