1 #include <bits/stdc++.h>
 2 using namespace std;
 3 const int maxn = 11;
 4 int dp[maxn][3],b[maxn];
 5 int dfs(int p,int st,bool flag){
 6     if(!p) return st == 2;
 7     if(flag && dp[p][st] != -1) return dp[p][st];
 8     int u = flag?9:b[p],ret = 0;
 9     for(int i = 0; i <= u; ++i){
10         if(st == 2 || i == 4 || st == 1 && i == 2) ret += dfs(p-1,2,flag||(i < u));
11         else if(i == 6) ret += dfs(p-1,1,flag||(i < u));
12         else ret += dfs(p-1,0,flag||i < u);
13     }
14     if(flag) dp[p][st] = ret;
15     return ret;
16 }
17 int solve(int x){
18     int len = 0;
19     while(x){
20         b[++len] = x%10;
21         x /= 10;
22     }
23     return dfs(len,0,0);
24 }
25 int main(){
26     int a,b;
27     memset(dp,-1,sizeof dp);
28     while(~scanf("%d%d",&a,&b)){
29         if(!a && !b) break;
30         int ret = b - a + 1;
31         ret -= solve(b);
32         ret += solve(a-1);
33         printf("%d\n",ret);
34     }
35     return 0;
36 }