#include <iostream>

#include <algorithm>

#include <vector>

using namespace std;

const int N = ;

/*

001~abc-1, 999

abcxegf

    1. num[i] < x, 0

    2. num[i] == x, 0~efg

    3. num[i] > x, 0~999

*/

int get(vector<int> num, int l, int r) {//求前面这些位组成的数字是多少

    int res = ;

    for (int i = l; i >= r; i -- ) res = res *  + num[i];

    return res;

}

int power10(int x) {//求10的i次方

    int res = ;

    while (x -- ) res *= ;

    return res;

}

int count(int n, int x) {//1到n当中，x出现的次数

    if (!n) return ;

    vector<int> num;//每一位

    while (n) {

        num.push_back(n % );

        n /= ;

    }

    n = num.size();

    int res = ;

    for (int i = n -  - !x ; i >= ; i -- ) {

        //判断是否是在枚举最高位

        if (i < n - ) {

            //            i前面所有这些位数

            res += get(num, n - , i + ) * power10(i);

            if (!x) res -= power10(i);

        }

        if (num[i] == x) res += get(num, i - , ) + ;

        else if (num[i] > x) res += power10(i);

    }

    return res;

}

int main() {

    int a, b;

    while (cin >> a >> b , a) {

        if (a > b) swap(a, b);

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

            cout << count(b, i) - count(a - , i) << ' ';

        cout << endl;

    }

    return ;

}