#include<bits/stdc++.h>
using namespace std;
int power10(int i)
{
int res = 1;
while(i--)
res *= 10;
return res;
}
int get(vector<int> num,int l,int r)
{
int res=0;
for(int i=r;i>=l;--i)
{
res = res*10 + num[i];
}
return res;
}
int count(int n,int x)
{
if(!n) return 0;
vector<int> num;
int res=0;
while(n)
{
num.push_back(n % 10);
n /= 10;
}
n = num.size();
for(int i = n - 1 - !x ;i >= 0;--i)
{
if(i < n - 1)
//当x在首位时,结果为 0*power10(i),因此不用计算
{
res += get(num,i+1,n-1) * power10(i);
if (x == 0)
//x为0时,减去x在首位的那种情况
res -= power10(i);
}
if(num[i] == x) res += get(num,0,i-1) + 1;
else if(num[i] > x) res += power10(i);
}
return res;
}
int main()
{
int a,b;
while(cin>>a>>b,a||b)
{
if(a>b) swap(a,b);
for(int i=0;i<10;++i)
cout<<count(b,i) - count(a-1,i)<<' ';
cout<<endl;
}
return 0;
}