#include <bits/stdc++.h>
using namespace std;
long long dp[19][11][11][2][2][11];
string num;
long long rec(int pos, int prev1, int prev2, int f, int prev, int k) {
if(pos == num.size()) return 1;
if(dp[pos][prev1][prev2][prev][f][k] != -1) return dp[pos][prev1][prev2][prev][f][k];
int LIM = 9;
if(!f) LIM = num[pos] - '0';
long long res = 0;
for (int i = 0; i<=LIM; i++) {
if(prev) {
if(i == prev2 || i == prev1) continue;
res += rec(pos + 1, i, prev1, (f || i < LIM), prev, i);
}
else {
res += rec(pos + 1, i, prev1, (f || i < LIM), (i != 0), i);
}
}
return dp[pos][prev1][prev2][f][prev][k] = res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long a,b, k = 0;
cin >> a >> b;
if(a == 0) k += 1;
memset(dp, -1, sizeof(dp)); num = to_string(b);
b = rec(0, 10, 10, 0, 0, 10);
a = max(a-1, 0LL);
memset(dp, -1, sizeof(dp)); num = to_string(a);
cout << b - rec(0, 10, 10, 0, 0, 10) + k << '\n';
return 0;
}