#include<bits/stdc++.h>
#define int long long
using namespace std;
int l,r,dp[21][2][2],id,a[21];
int dfs(int pos,bool h,bool fr,int x){
	if(pos==0)return x;
	if(dp[pos][h][fr]!=-1)return dp[pos][h][fr];
	int res=0,limit=fr?a[pos]:9;
	for(int i=0;i<=limit;i++){
		h=h&&(i==0);
		res+=dfs(pos-1,h,fr&&(i==limit),x+((i==id)&&(!h)));
	}
	dp[pos][h][fr]=res;
	return res;
}
int solve(int x){
	int cnt=0;
	if(x==0)a[++cnt]=0;
	else{
		while(x){
			a[++cnt]=x%10;
			x/=10;
		}
	}
	return dfs(cnt,1,1,0);
}
signed main(){
	cin>>l>>r;
	memset(dp,-1,sizeof dp);
	id=0;
	cout<<solve(11)<<endl;
	for(int i=0;i<=9;i++){ 
		memset(dp,-1,sizeof dp);
		id=i;
		cout<<solve(r)-solve(l-1)<<" ";
	}
	return 0;
}