#include<bits/stdc++.h>
using namespace std;
#define task "task"
#define ii pair<int,int>
#define fi first
#define se second
#define int long long
#define ll long long
#define ld double
#define mp make_pair
#define lg2 30
#define iii pair<int,ii>
#define iiii pair<ii,ii>
//#define base 29
#define eps 1e-8
int dx[]= {0LL,0LL,1,-1,1,1,-1,-1};
int dy[]= {1,-1,0LL,0LL,1,-1,1,-1};
const int maxn=4e5+1;
const int mod=1e9+7;
void init()
{
}
string s;
int dp[20][11][11][2][2][2];
int dqcn(int i,int lst1,int lst2,bool ko,bool doi,bool lim)
{
if(i==s.size())return !doi;
if(dp[i][lst1][lst2][ko][doi][lim]!=-1)return dp[i][lst1][lst2][ko][doi][lim];
dp[i][lst1][lst2][ko][doi][lim]=0;
int limm;
if(lim==true)limm=s[i]-'0';
else limm=9;
for(int j=0;j<=limm;j++)
{
ko|=(j!=0);
if(ko)
dp[i][lst1][lst2][ko][doi][lim]+=dqcn(i+1,j,lst1,ko,doi|(j==lst1)|(j==lst2),lim&&(j==limm));
else
dp[i][lst1][lst2][ko][doi][lim]+=dqcn(i+1,lst1,lst2,ko,doi,lim&&(j==limm));
}
return dp[i][lst1][lst2][ko][doi][lim];
}
int f(int x)
{
s=to_string(x);
memset(dp,-1,sizeof(dp));
return dqcn(0,10,10,false,false,true);
}
void process()
{
int a,b;
cin>>a>>b;
if(a==1)
cout<<f(b);
else
cout<<f(b)-f(a-1);
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen(task".inp","r"))
{
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin>>t;
while(t--)
{
init();
process();
cout<<'\n';
}
cerr <<endl<< "TIME : " << clock() * 0.001 << "s" << endl ;
}
