#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
const int MAXN = 1e5 + 5;
const int MAXZ = 1e5 + 5;
const ll INF = 1e18 + 5;
const int MOD = 998244353;
vector<ll> num;
int k, s;
ll a, b;
ll dp[20][12][12][2][2];
ll inv[20], p[20];
ll bin(ll x, ll m) {
if (m == 0) return 1;
ll u = bin(x, m / 2);
u = (u * u) % MOD;
if (m & 1) u = (u * x) % MOD;
return u;
}
ll ans(int i, int prev, int second_prev, bool tight, bool leading) {
if (i == num.size()) return 1;
ll& ret = dp[i][prev][second_prev][tight][leading];
if (ret != -1) return ret;
ret = 0;
ll next = num[i];
if (tight) {
for (int d = 0; d <= next; ++d) {
bool is_leading = (d == 0 && leading);
int new_prev = is_leading ? 11: d, new_second_prev = is_leading ? 11: prev;
if (d == prev) continue;
if (d == second_prev) continue;
ret += ans(i + 1, new_prev, new_second_prev, d == next, is_leading);
}
} else {
for (int d = 0; d <= 9; ++d) {
bool is_leading = leading && (d == 0);
int new_prev = is_leading ? 11: d, new_second_prev = is_leading ? 11: prev;
if (d == prev) continue;
if (d == second_prev) continue;
ret += ans(i + 1, new_prev, new_second_prev, false, is_leading);
}
}
return ret;
}
ll solve(ll x) {
num.clear();
while(x) {
num.push_back(x % 10);
x /= 10;
}
reverse(num.begin(), num.end());
memset(dp, -1, sizeof dp);
s = num.size();
ll r = ans(0, 11, 11, true, true);
return r;
}
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
// freopen("time.in", "r", stdin);
// freopen("time.out", "w", stdout);
cin >> a >> b;
cout << solve(b) - solve(a - 1);
return 0;
}
