#include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<iostream>

 #include<ctime>

 #include<queue>

 using namespace std;

 typedef long long LL;

 const int N=;

 int c[N][N][][],d[N],sum[N];

 LL bit[N],ret[N];

 LL g(int now,int x,int flag,int zero)

 {

     if(c[now][x][flag][zero]!=-) return c[now][x][flag][zero];

     if(x==) return ;

     LL ans=;

     if(flag)

     {

         for(int i=;i<d[x];i++)

         {

             ans+=g(now,x-,,zero & (i==));

             if(i==now && !(i== && zero)) ans+=bit[x-];

         }

         ans+=g(now,x-,,zero && (d[x]==));

         if(now==d[x] && !(now== && zero)) ans+=ret[x-];

     }

     else

     {

         for(int i=;i<=;i++)

         {

             ans+=g(now,x-,,zero & (i==));

             if(i==now && !(i== && zero)) ans+=bit[x-];

         }

     }

     // printf("now %d  x %d  flag %d  zero %d  = %d\n",now,x,flag,zero,ans);

     c[now][x][flag][zero]=ans;

     return ans;

 }

 void solve(LL x,LL tmp)

 {

     memset(d,,sizeof(d));

     memset(c,-,sizeof(c));

     int l=;LL y=x;

     while(y)

     {

         d[++l]=(int)(y%);

         y/=;

     }

     for(int i=;i<=;i++) ret[i]=x%bit[i]+;

     for(int i=;i<=;i++) sum[i]+=g(i,,,)*tmp;

 }

 int main()

 {

     // freopen("a.in","r",stdin);

     freopen("dream.in","r",stdin);

     freopen("dream.out","w",stdout);

     LL A,B;int x;

     scanf("%lld%lld",&A,&B);

     memset(sum,,sizeof(sum));

     bit[]=;

     for(int i=;i<=;i++) bit[i]=bit[i-]*;

     solve(A-,-);

     solve(B,);

     for(int i=;i<=;i++) printf("%d ",sum[i]);

     return ;

 }