#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

ll calc(string s){
  if(s.size()==1){
    if(s[0]>='2')return 1;
    return 0;
  }
  ll ret = 1; // 0 [1 2] 3 ...
  int n = s.size();
  // include '12'
  // keta/less/beforeIs1/cnt12
  ll dp[n+1][2][2][10]; fill(dp[0][0][0],dp[n+1][0][0],0ll);
  dp[0][0][0][0] = 1;
  REP(keta,n)REP(less,2)REP(bef,2)REP(cnt,10){
    int d = s[keta]-'0';
    REP(t,10){
      if(less || t<d || (t==d&&!less) )dp[keta+1][less || t<d][t==1][min(9ll,cnt+(ll)(bef&&t==2))]
        += dp[keta][less][bef][cnt];
    }
  }
  REP(bef,2)REP(less,2)REP(cnt,10) ret += cnt*dp[n][less][bef][cnt];
  //
  // conected '12'
  // keta/less/topis2/endis1/leading-zero
  ll dp2[n+1][2][2][2][2]; fill(dp2[0][0][0][0],dp2[n+1][0][0][0],0ll);
  dp2[0][0][0][0][1] = 1;
  REP(keta,n)REP(less,2)REP(top,2)REP(end,2)REP(lead,2){
    int d = s[keta]-'0';
    REP(t,10){
      if(less || t<d || (t==d&&!less))
        dp2[keta+1][less||t<d][top||(lead&&t==2)][end||(keta==n-1&&t==1)][lead&&t==0]
          += dp2[keta][less][top][end][lead];
    }
  }
  ll tmp = 0;
  REP(less,2) tmp += dp2[n][less][1][1][0];
  ret += tmp;
  if(s[s.size()-1]=='1' && s[0]=='2')--ret;
  return ret;
}

int main(){
  string a,b;
  cin >> a >> b;
  string c = a;
  int iter = c.size()-1;
  while(c[iter]=='0'){
    c[iter] = '9';
    --iter;
  }
  --c[iter];
  ll result = 0;
  result += calc(b);
  result -= calc(c);
  if(c[c.size()-1]=='1' && a[0]=='2')result -= 1;
  cout << result << endl;
  return 0;
}