Digits

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
ll tdig(ll n){
    ll a(0),k(-1),N(n),P(1),D;
    while(N)a=N,N/=10,++k,P*=10;
    P/=10;
    D=(k+1)*((n%(P*a))+1+(a-1)*P);
    F(k)D+=9*(i+1)*pow(10,i);
    return D+1;
}
ll dg(ll n,ll d);
ll zr(ll n,ll d){
    ll D=(tdig(n));
    FT(1,10)D-=dg(n,k);
    return D;
}
ll dg(ll n,ll d){
    if(n<10)return d<=n;
    if(!d)return zr(n,d);
    ll a(0),k(-1),N(n),P(1);
    while(N)a=N,N/=10,++k,P*=10;
    P/=10;
    if(a<d) return dg(n%(P*a),d)+k*P*a/10;
    if(a==d)return dg(n%(P*a),d)+k*P*a/10+1+(n%(P*a));
    return (a*k+10)*(P/10)+dg(n%(P*a),d);
}
ll A,B;
int main(void){
    while(scanf("%lld%lld",&A,&B),B)
        F(10)printf("%lld%c",dg(B,i)-dg(A-1,i),i^9?32:10);
    return 0;
}