#include<cstdio>

 #include<algorithm>

 #include<cstring>

 using namespace std;

 typedef long long ll;

 int len;

 int border[];

 ll l,r;

 ll dp[][];

 ll dfs(int pos,int sum,int ling,int limit,int num)

 {

     if(pos<) return sum;

     if(!limit&&dp[pos][sum]!=-&&!ling) return dp[pos][sum];

     ll tmp=;

     ll lim=limit ? border[pos] : ;

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

     {

         if(ling&&i==) tmp+=dfs(pos-,,,limit&&i==lim,num);

         else tmp+=dfs(pos-,sum+(i==num ?  : ),,limit&&i==lim,num);

     }

     if(!ling&&!limit) dp[pos][sum]=tmp;

     return tmp;

 }

 ll work(ll x,int num)

 {

     len=;

     memset(dp,-,sizeof(dp));

     while(x)

     {

         border[++len]=x%;

         x/=;

     }

     return dfs(len,,,,num);

 }

 int main()

 {

     scanf("%lld%lld",&l,&r);

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

         printf("%lld ",work(r,i)-work(l-,i));

     return ;

 }