#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cmath>

#include<cstring>

#include<string>

#include<queue>

#include<map>

#include<cstdlib>

#include<stack>

#define N 11

using namespace std;

int d[N];

int value;

void deal(int n)

{

    if(n<=0) return;

    int one,ten;

    one=n%10;

    n/=10;

    ten=n;

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

    {

        d[i]+=value;

    }

    while(ten)

    {

        d[ten%10]+=(one+1)*value;

        ten/=10;

    }

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

        d[i]+=value*n;

    d[0]-=value;

    value*=10;

    deal(n-1);

}

int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    int s,e;

    while(cin>>s>>e,s||e)

    {

        if(s>e)swap(s,e);

        memset(d,0,sizeof d);

        value=1;

        deal(e);

        value=-1;

        deal(s-1);

        cout<<d[1]<<endl;

    }

    return 0;

}