#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define PII pair<int, int>

#define y1 skldjfskldjg

#define y2 skldfjsklejg

using namespace std;

const int N = 2e5 + ;

const int M = 1e7 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = ;

LL f[][], L, R;

int s[], tot;

LL dp(int p, int cnt, bool limit, bool zero, int val) {

    if(p == -) return cnt;

    if(!limit && !zero && ~f[p][cnt]) return f[p][cnt];

    LL ans = ;

    int up = limit ? s[p] : ;

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

        if(!val) ans += dp(p - , cnt + (!zero && (!i)), limit && (i == up), zero && (!i), val);

        else ans += dp(p - , cnt + (val == i), limit && (i == up), zero && (!i), val);

    }

    if(!limit && !zero) f[p][cnt] = ans;

    return ans;

}

LL solve(LL x, int val) {

    if(x < ) return ;

    tot = ;

    for(LL i = x; i; i /= ) s[tot++] = i % ;

    memset(f, -, sizeof(f));

    return dp(tot - , , , , val);

}

int main() {

    scanf("%lld%lld", &L, &R);

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

        printf("%lld ", solve(R, i) - solve(L - , i));

    }

    puts("");

    return ;

}

/*

*/