#include<iostream>
#include<algorithm>
using namespace std;
int dp[10][10],num[10];
void init()
{
    dp[0][0] = 1;
    for(int i=1;i<=7;i++)
        for(int j=0;j<10;j++)
            for (int k = 0; k < 10; k++)
                if (j != 4 && !(j == 6 && k == 2))
                    dp[i][j] += dp[i - 1][k];
}
int solve(int n)
{
    int ans = 0, t = 0;
    while (n)
    {
        num[++t] = n % 10;
        n /= 10;
    }
    num[t + 1] = 0;
    for (int i = t; i >= 1; i--)
    {
        for (int j = 0; j < num[i]; j++)
        {
            if (!(num[i + 1] == 6 && j == 2))
                ans += dp[i][j];
        }
        if (num[i] == 4 || (num[i + 1] == 6 && num[i] == 2))
            break;
    }
    return ans;
}
int main()
{
    init();
    int n, m;
    while (cin >> n >> m,(n||m))
    {
        cout << solve(m+1) - solve(n) << endl;
    }
    return 0;
}