#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;

string minus1(string s){
  ll n=s.size();
  reverse(all(s));
  rep(i,n){
    if(s[i]!='0'){
      s[i]--;
      break;
    }
    s[i]='9';
  }
  if(s[n-1]=='0') s.resize(n-1);
  reverse(all(s));
  return s;
}

ll dp[20][2][2][20]; // pos, isLess, prevNum is 1?, num of 12

// a~bの中に含まれる12の個数
ll f(string s){
  memset(dp,0,sizeof(dp));
  dp[0][0][0][0]=1;
  ll n=s.size();
  rep(i,n) rep(j,2) rep(k,2) rep(l,20){
    ll now=s[i]-'0';
    rep(nxt,10){
      if(nxt>now&&j==0) continue;
      ll nj=j|nxt<now, nk=nxt==1?1:0;
      if(k==1&&nxt==2) dp[i+1][nj][nk][l+1]+=dp[i][j][k][l];
      else dp[i+1][nj][nk][l]+=dp[i][j][k][l];
    }
  }
  ll ans=0;
  rep(j,2) rep(k,2) irep(l,1,20){
    ans+=dp[n][j][k][l]*l;
  }
  return ans;
}

ll dp2[20][2][2][10]; // pos, isLess, leading zero, prevNum

// 隣り合う数によって12が生まれる場合
// これは、2***1 であるような数の個数と一致する
// 2数の差が1で、x***1の次の次に来る数の先頭が先頭が2であるなら、前者の先頭の数も2であるはずである
ll g(string s){
  ll n=s.size();
  memset(dp2,0,sizeof(dp2));
  dp2[0][0][0][0]=1;
  rep(i,n) rep(j,2) rep(k,2) rep(l,10){
    ll now=s[i]-'0';
    rep(nxt,10){
      if(nxt>now&&j==0) continue;
      ll nj=j|nxt<now, nk=k|nxt!=0;
      if(k==0 && l==0){
        if(nxt==2) dp2[i+1][nj][nk][nxt]+=dp2[i][j][k][l];
        if(nxt==0) dp2[i+1][nj][nk][nxt]+=dp2[i][j][k][l];
      }else{
        dp2[i+1][nj][nk][nxt]+=dp2[i][j][k][l];
      }
    }
  }
  ll ans=0;
  rep(j,2){
    ans+=dp2[n][j][1][1];
  }
  if(s.size()>0 && stoll(s)>=1) ans++;
  return ans;
}

signed main()
{
  cin.tie( 0 ); ios::sync_with_stdio( false );
  string a,b; cin>>a>>b;
  
  a=minus1(a);
  ll ans=f(b)-f(a);
  // b=minus1(b);
  ans+=g(b)-g(a);
  
  // cout<<f(b)<<' '<<f(a)<<endl;
  // cout<<g(b)<<' '<<g(a)<<endl;
  
  cout<<ans<<endl;
  
}