#include <iostream>

#include <cstring>

#include <cstdio>

using namespace std;

int n, m, num[], dp[][];

inline int dfs(int l, bool flag, bool limit) {

    if(l == ) return ;

    if(!limit && dp[l][flag]) return dp[l][flag];

    int ans = , mx = (limit ? num[l] : );

    for(int i=; i<=mx; i++) {

        if(i == ) continue;

        if(flag && i == ) continue;

        ans += dfs(l-, i == , limit && i == mx);

    }

    return limit ? ans : dp[l][flag] = ans;

}

inline int solve(int x) {

    memset(num, , sizeof(num));

    int k = ;

    while (x != ) {

        num[++k] = x % ;

        x /= ;

    }

    return dfs(k, false, true);

}

int main() {

    while (scanf("%d%d", &n, &m) == ) {

        if(n ==  && m == ) break;

        printf("%d\n", solve(m)-solve(n-));

    }

    return ;

}