1 100
0 0

80

#include<stdio.h>
#include<string.h>
int bit[20];
int dp[20][10];
int dfs(int pos,int pre,int isture,int limit)
{
	if(pos<0)
		return 1;
	if(!limit&&isture&&dp[pos][pre]!=-1)
		return dp[pos][pre];
	int last=limit?bit[pos]:9;
	int ans=0;
	for(int i=0;i<=last;i++)
	{
		if(i==4)
			continue;
		if(!isture||!(i==2&&pre==6))
		{
			ans+=dfs(pos-1,i,isture||i,limit&&(i==last));
		}
	}
	if(!limit&&isture)
	{
		dp[pos][pre]=ans;
	}
	return ans;
}
int solve(int n)
{
	int len=0;
	while(n)
	{
		bit[len++]=n%10;
		n/=10;
	}
	return dfs(len-1,0,0,1);
}
int main()
{
	int n,m;
	memset(dp,-1,sizeof(dp));
	while(scanf("%d%d",&n,&m)!=EOF,n||m)
	{
		printf("%d\n",solve(m)-solve(n-1));
	}
}