#include<bits/stdc++.h>
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define drep(x,y,z) for(int x=y;x>=z;x--)
#define ull unsigned long long
#define ll long long
using namespace std;
inline int read()
{
	int x=0;bool flag=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-')flag=0;ch=getchar();}
	while(ch>='0'&&ch<='9') {x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	if(flag) return x;
	return ~(x-1);
}
inline void write(int x)
{
	if(x<0) {x=~(x-1);putchar('-');}
	if(x>9) write(x/10);
	putchar(x%10+'0');
}
////////////////////////
ll l,r; 
int ls=1,rs=1;
int a[20],b[20];
ll ans[15];
inline ll ask_a(int x)
{
	ll re=0;
	for(;x;x--){re*=10;re+=a[x];}
	return re;
}
inline ll ask_b(int x)
{
	ll re=0;
	for(;x;x--){re*=10;re+=b[x];}
	return re;
}
int main()
{
    freopen("countzj.in","r",stdin);
	freopen("countzj.out","w",stdout);
	cin>>l>>r;
	ll s1=l,s2=r;
	for(;s1;s1/=10,ls++) a[ls]=s1%10;
	ls--;
	for(;s2;s2/=10,rs++) b[rs]=s2%10;
	rs--;
	ll cp=0;
	for(int i=max(rs,ls);i;i--)
	{
		
		for(int o=0;o<10;o++)
		{
			if(i>ls&&o==0) continue;
			s1=cp+1;
			if(o<a[i]) s1--;
			if(o>b[i]) s1--;
			if(o==a[i]) ans[o]-=ask_a(i-1);
			if(o==b[i]) ans[o]-=(pow(10,i-1)-ask_b(i-1)-1);
			ans[o]+=s1*pow(10,i-1);
//			cout<<"p1:"<<o<<" "<<ans[o]<<endl;
		}
		cp*=10;
		cp+=b[i]-a[i];
	}
	for(int i=0;i<10;i++) cout<<ans[i]<<" ";
	cout<<endl;
    return 0;
}