//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 2000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t,dp[30][6][15][15],aman;
int cev;
string s;
vector<int> v,vv;
inline int add(int x,int y){
if(x+y>=inf){aman=1;return x+y-inf;}
return x+y;
}
inline int f(int sira,int al,int last2,int last1){
int cevv=0;
if(sira==(int)v.size())return 1;
if(~dp[sira][al][last2][last1])return dp[sira][al][last2][last1];
for(int i=0;i<=9;i++){
if(al==0 && i>v[sira])break;
if(i==last2 || i==last1)continue;
if(last1==10 && last2==10 && i==0){
int yes=0;
if(i<v[sira])yes=1;
cevv=add(cevv,f(sira+1,max(yes,al),10,10));
}
else{
int yes=0;
if(i<v[sira])yes=1;
cevv=add(cevv,f(sira+1,max(yes,al),last1,i));
}
}
return dp[sira][al][last2][last1]=cevv;
}
inline int f1(int sira,int al,int last2,int last1){
int cevv=0;
//~ cout<<sira<<" : : "<<al<<" : : "<<last2<<" : : "<<last1<<endl;
if(sira==(int)vv.size())return 1;
if(~dp[sira][al][last2][last1])return dp[sira][al][last2][last1];
for(int i=0;i<=9;i++){
if(al==0 && i>vv[sira])continue;
if(i==last2 || i==last1)continue;
//~ if(sira==0 && i==0)continue;
if(last1==10 && last2==10 && i==0){
int yes=0;
if(i<vv[sira])yes=1;
cevv=add(cevv,f1(sira+1,max(yes,al),10,10));
}
else{
int yes=0;
if(i<vv[sira])yes=1;
cevv=add(cevv,f1(sira+1,max(yes,al),last1,i));
}
}
return dp[sira][al][last2][last1]=cevv;
}
main(void){
scanf("%lld %lld",&n,&m);
if(m-n<=1000000){
for(int i=n;i<=m;i++){
int last1=-1,last2=-1;
flag=0;
int ii=i;
while(ii){
if(ii%10==last2 || ii%10==last1)flag=1;
last2=last1;
last1=ii%10;
ii/=10;
}
if(flag==0)cev++;
}
printf("%lld\n",cev);
return 0;
}
n--;
if(n==-1)flag=1;
while(n){
v.pb(n%10);
n/=10;
}
while(m){
vv.pb(m%10);
m/=10;
}
//~ v=vv;
reverse(v.begin(),v.end());
reverse(vv.begin(),vv.end());
//~ for(int i=0;i<(int)vv.size();i++)printf("%lld",vv[i]);
//~ printf("\n");
//~ for(int i=0;i<(int)v.size();i++)printf("%lld",v[i]);
//~ printf("\n");
memset(dp,-1,sizeof(dp));
//~ if(n==-1)
cev=f1(0,0,10,10);
memset(dp,-1,sizeof(dp));
if(flag)cev=0;
//~ cout<<cev<<endl;8
printf("%lld\n",cev-f(0,0,10,10));
//~ cout<<aman<<endl;
return 0;
}
