#include <bits/stdc++.h>
#define int long long
using namespace std;
int f[30][30],a[30];
int dfs(bool lead,bool limit,int pos,int sum,int target)
{
  // sum:当前这个数已找到 sum 个
	if(!pos) return sum;
	if(!limit&&!lead&&f[pos][target]) return f[pos][sum];
	int up = limit?a[pos]:9;
	int res = 0;
	for(int i=0;i<=up;i++)
		if(!target)
			res += dfs(lead&&(i==0),limit&&(i==up),pos-1,sum+(!lead&&(i==0)),target);
		else
			res += dfs(lead&&(i==0),limit&&(i==up),pos-1,sum+(i==target),target);
	if(!limit&&!lead) f[pos][sum]=res;
	return res;
}
int solve(int x,int num)
{
	memset(f,0,sizeof(f));
	memset(a,0,sizeof(a));
	int len=0;
	while(x) {
		a[++len]=x%10;
		x/=10;
	}
	return dfs(1,1,len,0,num);
}
signed main()
{
	int l;int r;
	cin >> l >> r;
	for(int i=0;i<=9;i++)
		cout << solve(r,i)-solve(l-1,i) << " ";
	return 0;
}