#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

ll dp[15][2][2][2][2][8];

ll f(ll R){
    string S = to_string(R);
    each(c, S)c -= '0';
    MEM(dp, 0);
    dp[0][0][0][0][0][0] = 1;
    rep(i, sz(S))rep(preOne, 2)rep(les, 2)rep(btwo, 2)rep(po, 2)rep(cnt12, 8){
        ll val = dp[i][preOne][les][btwo][po][cnt12];
        if(val == 0)continue;
        rep(d, 10){
            if(!les&&d > S[i])break;
            int nPreOne = d==1, nLes = les | (d < S[i]), nBtwo = btwo, nPo = po | (d>0), nCnt12 = cnt12;
            if(po == 0 && d == 2)nBtwo = 1;
            if(preOne && d == 2)nCnt12++;
            dp[i + 1][nPreOne][nLes][nBtwo][nPo][nCnt12] += val;
        }
    }

    ll res = 0;
    if(R >= 2)res++;
    rep(preOne, 2)rep(les, 2)rep(btwo, 2)rep(po, 2)rep(cnt12, 8){
        res += dp[sz(S)][preOne][les][btwo][po][cnt12] * cnt12;
        if(btwo && preOne && les)res += dp[sz(S)][preOne][les][btwo][po][cnt12];
    }
    return res;
}

int main(){
    ll A, B;
    while(cin >> A >> B){
        ll ans = (f(B) - f(A - 1));
        string s = to_string(A - 1), t = to_string(A);
        if(s.back() == '1'&&t[0] == '2')ans--;
        cout << ans << endl;
    }
}