A Benedict monk No.16 writes down the decimal representations of all natural numbers between and including m and n, m ≤ n. How many 0's will he write down?

Input consists of a sequence of lines. Each line contains two unsigned 32-bit integers m and n, m ≤ n. The last line of input has the value of mnegative and this line should not be processed.

For each line of input print one line of output with one integer number giving the number of 0's written down by the monk.

 #include<bits/stdc++.h>

 using namespace std;

 #define ll long long

 ll a[],b[],l,r;

 void dp(ll t,ll *c,ll d)

 {

     ll n=t/,m=t%,temp=n;

     //for(int i=1;i<=m;i++)c[i]+=d;

     //for(int i=0;i<=9;i++)c[i]+=d*n;

     c[]+=d*n;

     while(temp)

     {

         c[temp%]+=(m+)*d;

         temp/=;

     }

     if(n)dp(n-,c,d*);

 }

 int main()

 {

     while(scanf("%lld%lld",&l,&r)!=EOF)

     {

         if(l==-&&r==-)break;

         memset(a,,sizeof(a));

         memset(b,,sizeof(b));

         dp(l-,a,);

         dp(r,b,);

         if(l==)b[]++;

         printf("%lld\n",b[]-a[]);

     }

     return ;

 }