# include<iostream># include<cstdio># include<cstring># include<algorithm># include<vector>using namespace std;int s,t;int res[10],dig[20],len;void solve(int num){ num ++; len =0; int temp =1; while(1) { dig[++len] = num%10; num /= 10; if(!num) break; temp *= 10; } for(int i=1; i<10; i++) res[i] += (len-1)*temp/10; res[0] += (len-1)*temp/10-(temp-1)/9; for(int i=1; i<dig[len]; i++) { res[i] += temp; for(int j=0; j<10; j++) res[j] += (len-1)*temp/10; } temp /= 10; for(int i=len-1; i>=1; i--) { for(int j=0; j<dig[i]; j++) { for(int k=len; k>i; k--) res[dig[k]] += temp; res[j] += temp; for(int k=0; k<10; k++) res[k] += (i-1)*temp/10; } temp /= 10; }}int main(){ while(scanf("%d%d",&s,&t)&& s &&t) { memset(res,0,sizeof(res)); if(s>t) swap(s,t); solve(s-1); for(int i=0; i<10; i++) res[i] = -res[i]; solve(t); for(int i=0; i<9; i++) printf("%d ",res[i]); printf("%dn",res[9]); } return 0;}
