#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
const ll MOD=1e9+7;

ll p10[20];

ll cnt(ll n){
  //cout<<n<<":"<<endl;
  ll re=n>=2;
  //cout<<re<<endl;
  for(ll d=1;n/d>=12;d*=10){
    re+=(n/100/d + (n/d%100>12))*(d);
    if(n/d%100==12) re+=n%d+1;
    //cout<<(n/100/d+ (n/d%100>12))<<","<<(d)<<","<<(n%d+1)*(n/d%100==12)<<endl;
  }
  //cout<<re<<endl;
  /*for(ll d=1;n/d;d*=10){
    if(n/d%10<2) continue;
    }*/
  for(ll d=1;n/d;d*=10){
    if(n/d/10){
      re+=d/10;
    }else{
      if(n/d<2) continue;
      if(n/d==2){
	re+=n%d/10+(n%10>1 && n>2);
      }else{
	re+=d/10;
      }
    }
  }
  //cout<<re<<endl;
  return re;
}

ll solve(ll a, ll b){
  ll d;
  for(d=a;d/10;d/=10);
  return cnt(b)-cnt(a-1)-((a-1)%10==1 && d==2);
}

ll bf(ll a, ll b){
  stringstream ss;
  for(ll i=a;i<=b;++i) ss<<i;
  string str;
  ss>>str;
  ll re=0;
  rep(i,str.size()-1) if(str.substr(i,2)=="12") ++re;
  return re;
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  rep(i,100*00){
    ll a=rand()%1000,b=rand()%1000;
    b+=a;
    //cout<<a<<","<<b<<endl;
    ll ans=solve(a,b),exp=bf(a,b);
    if(ans!=exp){
      cout<<a<<","<<b<<endl;
      cout<<"expected "<<exp<<" found "<<ans<<endl;
    }
  }
  ll a,b;
  cin>>a>>b;
  cout<<solve(a,b)<<endl;
  return 0;
}