#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
const int N = 20;
long long f[N][N],num[N],ii;
long long dfs(int loc,int limit, bool zero, int sum){
if(loc==-1){
return sum;
}
if(!zero&&!limit&&f[loc][sum]+1){
return f[loc][sum];
}
int tmp=limit?num[loc]:9;
long long ans=0;
for(int i=0;i<=tmp;i++){
ans+=dfs(loc-1,limit&&i==num[loc],zero&&i==0,sum+(ii==0&&i==0&&!zero||ii&&i==ii));
/*
if(zero&&i==0){
ans+=dfs(loc-1,0,0,1);
}else{
ans+=dfs(loc-1,limit&&(i==num[loc]),zero&&i==0,sum+(ii==0&&i==0&&!zero||ii&&i==ii));
}
*/
}
if(!zero&&!limit){
f[loc][sum]=ans;
}
return ans;
}
long long solve(long long x){
int loc=0;
while(x){
num[loc++]=x%10;
x/=10;
}
memset(f,-1,sizeof(f));
return dfs(loc-1,1,1,0);
}
int main(){
long long a,b;
cin>>a>>b;
for(ii=0;ii<10;++ii){
cout<<solve(b)-solve(a-1)<<" ";
}
return 0;
}
12-12
335