#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll count(ll a, int t){
    if(a==0) return 0;
    ll ret=0;
    ll p=1;
    for(int i=0; i<15; i++){
        ret+=(a/p+87)/100*p;
        if(a/p%100==12) ret+=(a%p+1);
        p*=10;
    }
    if(t) a--;
    p=10;
    for(int i=0; i<15; i++){
        if(a<=2*p) break;
        if(a>=3*p) ret+=p/10;
        else ret+=(a-2*p+9)/10;
        p*=10;
    }
    return ret;
}
int main()
{
    ll a, b;
    cin>>a>>b;
    ll ans=count(b, 1)-count(a-1, 0);
    if(a==1 && b>=2) ans++;
    cout<<ans<<endl;
    return 0;
}