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

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  2017/11/03  Problem: yukicoder319 / Link: https://yukicoder.me/problems/no/319  ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----



----解説ここまで---- */

LL N;

LL ans = 0LL;
LL dp[14][7][2][2];
LL f(string & target, int i, int has = 0, int one = 0, int less = 0) {
	if (i == -1) {
		return has;
	}
	if (dp[i][has][one][less] != -1 && less == 1)return dp[i][has][one][less];
	LL res = 0;
	int num = target[i] - '0';
	int Max = less ? 9 : num;
	FOR(nx, 0, Max + 1) {
		if (nx == 1) {
			res += f(target, i - 1, has,1, less || (nx < Max));
		}
		else if (nx == 2) {
			res += f(target, i - 1, one==1 ? has + 1 : has, 0, less || (nx < Max));
		}
		else res += f(target, i - 1, has, 0, less || (nx < Max));
	}

	if (less == 1)return dp[i][has][one][less] = res;
	return res;
}

LL calc[14];
LL oneandtwo(string &s) {
	reverse(ALL(s));
	LL ret = 0;
	FOR(i, 0, SZ(s)) {
		if (SZ(s) - 1 != i) {
			ret += calc[i];
		}
		else {//
			if (s[0] > '2') {
				ret += calc[i];
			}
			else if (s[0] == '2') {
				LL t = 0;
				FOR(j, 1, SZ(s) - 1) {
					t *= 10;
					t += s[j] - '0';
				}
				if (s.back() >= '2')t++;
				ret += t;
			}
			else {
				;
			}
		}
	}
	return ret;
}

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	LL a, b; cin >> a >> b;
	a--;
	string A, B;
	A = to_string(a);
	B = to_string(b);
	fill(***dp, ***dp + 14 * 7 * 2 * 2, -1);

	reverse(ALL(A));
	reverse(ALL(B));
	ans = f(B, SZ(B) - 1);
	ans -= f(A, SZ(A) - 1);

	FOR(i, 0, 14) {
		calc[i] = pow(10, (i ? i - 1 : 0));
		//debug(calc[i]);
	}
	ans += oneandtwo(B);
	a++;
	A = to_string(a);
	reverse(ALL(A));
	ans -= oneandtwo(A);
	cout << ans << "\n";

	return 0;
}