:::align{center} 小学奥数です
:::

#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define f(a,b) for(int i=a;i<=b;i++)
#define fj(a,b) for(int j=a;j<=b;j++)
#define fp(a,b) for(int p=a;p<=b;p++)
#define fq(a,b) for(int q=a;q<=b;q++)
#define debug cout<<"debug"<<endl
#define end cout<<endl
#define out(a) cout<<(a)
#define cmax(a,b) a=max(a,b)
#define time_test fprintf(stderr,"Time:%.6lf\n",(double)clock()/CLOCKS_PER_SEC)
using namespace std;
ll a,b;
ll s(ll n,ll x){
	ll cnt=0;
	for(ll i=1;n/i;i*=10)cnt+=n/i/10*i-(x==0?i:0),cnt+=(x<n%(i*10)/i?i:(x==n%(i*10)/i)*(n%i+1));
	return cnt;
}
int main(){
	cin>>a>>b;
	f(0,9)printf("%lld ",s(b,i)-s(a-1,i));
}