#include <bits/stdc++.h>
using namespace std;
int dp[9][10];
int bits[8];
void init(){
    dp[0][0] = 1;
    for(int i=1; i<=8; i++){
        for(int j=0; j<=9; j++)
        for(int k=0; k<=9; k++){
            if(j != 4 && !(j==6&&k==2)){
                dp[i][j] += dp[i-1][k];
            }
        }
    }
}
int n, m;
int solve(int n){
    int len = 1;
    while(n){
        bits[len++] = n%10;
        n /= 10;
    }
    bits[len] = 0;
    int ans = 0;
    for(int i=len-1; i>=1; i--){
        for(int j=0; j<bits[i]; j++){
            if( j!=4 &&!(bits[i+1] ==6&&j ==2))
                ans += dp[i][j];
        }
        if(bits[i] == 4||(bits[i+1] == 6&&bits[i] == 2))
            break;
    }
    return ans;
}
int main()
{
    init();
    while(~scanf("%d%d", &n, &m)&&n+m!=0){
        //为什么是+1,看递推的过程！表示小于的数字
        printf("%d\n", solve(m+1)-solve(n));
    }
    return 0;
}