/*
#ifndef ONLINE_JUDGE
#include "AkbarKING.h" // aska geldi akbarking.h
#else
#define debug(...)
#define debugArr(...)
#define debugG(...)
#endif
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#define int long long
#define $AzH_TxdmN$ ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#define ep emplace_back
#define pb push_back
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using __indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using __indexed_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int sz = 3e5+9;
const int LOG = 63;
const int MOD = 1e9+7;
const int INF = 1e18;
int dp[LOG][LOG][LOG][LOG];
int a,b;
vector<int>decomp;
void dec(int x)
{
decomp.clear();
while(x)
{
decomp.ep(x%10);
x/=10;
}
decomp.ep(0);
reverse(all(decomp));
}
int dfs(int pos, int val, int p1, int p2)
{
if (pos >= (int)decomp.size()) return 1LL;
if (dp[pos][val][p1][p2] != -1) return dp[pos][val][p1][p2];
int res = 0, x = (val == 0 ? 9 : decomp[pos]),y;
for (int i = 0; i <= x; ++i)
{
if (i == p1 || i == p2) continue;
int y = (i < x ? 0 : val);
res += dfs(pos+1,y,p2,i);
}
return dp[pos][val][p1][p2] = res;
}
int calc(int x)
{
dec(x);
memset(dp,-1LL,sizeof(dp));
return dfs(1LL,1LL,10LL,10LL);
}
void solve()
{
cin>>a>>b;
cout<<calc(b)-calc(a-1)<<'\n';
}
signed main()
{
$AzH_TxdmN$
int t = 1;
//cin>>t;
while (t--)
{
solve();
}
}
