#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,a) for (int i = 0; i < (a); i++)
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define ROF(i,a,b) for (int i = (a); i >= (b); i--)
#define SZ(x) (int)(x).size()
#define pb push_back

long long maxlen = 0;

int main()
{
    ios_base::sync_with_stdio(false);

    long long a,b;
    cin >> a >> b;
    if (a > 10) {
        cout << 0;
    }
    else {
        b--;
        if (b < 10) {
            cout << b - a + 1;
            return 0;
        }
        long long x = b;
        while (x != 0) x /= 10, maxlen++;
        long long cifre = 10 - a;
        long long Sol = 0;
        long long p = cifre;
        FOR(i,1,maxlen - 1) {
            Sol += p;
            p *= cifre;
        }
        /// cate nr de lungime maxlen <= b ?
        long long o = 0;
        while (b) {
            o = o * 10 + b % 10;
            b /= 10;
        }
        b = o;
        long long rem = maxlen;
        while (b) {
            rem--;
            if (b % 10 < a) {
                break;
            }
            if (b > 10) Sol += (long long)pow((long long)cifre,rem) * (b%10-a);
            else  Sol += (long long)pow((long long)cifre,rem) * (b%10-a + 1);
            b/=10;
        }
        cout << Sol;
    }
}