#include<bits/stdc++.h>
//#include "grader.h"
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;
ll dp[20][20][20];
ll mem[20];
ll cnt(ll cur) {
ll ret = 0;
string s = " " + to_string(cur);
reverse(s.begin(), s.end());
for (int i = s.size()-2; i >= 0; --i) {
if (s[i]-'0' != 0) ret += mem[i];
for (int j = 1; j < s[i]-'0'; ++j) {
if (j == s[i+1]-'0') continue;
for (int k1 = 0; k1 <= 10; ++k1) {
for (int k2 = 0; k2 <= 10; ++k2) {
if (j == k1 || j == k2 || k1 == s[i+1]) continue;
ret += dp[i][k1][k2];
}
}
}
}
return ret;
}
void solve() {
ll a, b; cin >> a >> b;
mem[1] = 10;
mem[2] = 81;
for (int i = 3; i <= 18; ++i) mem[i] = mem[i-1]*8;
for (int i = 2; i <= 18; ++i) mem[i] += mem[i-1];
for (int i = 0; i < 10; ++i) dp[1][i][10] = 1;
for (int i = 2; i <= 18; ++i) {
for (int j = 0; j < 10; ++j) {
for (int k1 = 0; k1 <= 10; ++k1) {
for (int k2 = 0; k2 <= 10; ++k2) {
if (j == k1 || j == k2) continue;
dp[i][j][k1] += dp[i-1][k1][k2];
}
}
}
}
cout << cnt(b+1) - cnt(a) << '\n';
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
