#include <iostream>
#include <cstdlib>
#include <vector>
#include <deque>
using namespace std;
typedef unsigned long long ll;
vector<int> u;
vector<int> T;
int CBR=0;
ll A=0;
// ADDING
ll fact[20];
ll ret_all(){
  ll del=1;
  int ob=0;
  for(int i=0;i<10;++i){del*=fact[T[i]];ob+=T[i];}
  return fact[ob]/del;
}
deque<int> ogr[20];
void add(){
  int i,j,ob=0;
  T=u;
  for(i=0;i<10;++i)ob+=T[i];
  deque<int> O=ogr[ob];
  for(i=0;i<ob;++i){
   int le=0;
   if(i==0)le=1;
   for(j=le;j<O[i];++j){
    if(T[j]>0){
     --T[j];
     A+=ret_all();
     ++T[j];
              }
                       }
   if(T[O[i]]>0)--T[O[i]];
   else break;
                   }
  if(i==ob)++A;
}
// </end>
void gen_all(int left){
  int i;
  if(u.size()==9){
   u.push_back(left);
   if(u[9]!=0 && u[9]%2==1){u.pop_back();return;}
   //do_work
   add();
   //for(i=0;i<10;++i)cout<<u[i]<<' ';
   //system("pause");
   u.pop_back();
   return;
                 }
  for(i=0;i<=left;++i){
   u.push_back(i);
   bool OK=true;
   if(u.size()%2==0){ // nechetna
    if(u.back()!=0 && u.back()%2==1)OK=false;
                    }
   else{
    if(u.back()!=0 && u.back()%2==0)OK=false;
       }
   if(OK)gen_all(left-i);
   u.pop_back();
                      }
}
// solve
ll prec[22]={
0LL,
4LL,
21LL,
122LL,
765LL,
5000LL,
34581LL,
249152LL,
1843485LL,
14184320LL,
111117141LL,
890892032LL,
7338139005LL,
60554071040LL,
518102719701LL,
4409318285312LL,
38356828343325LL,
341939662684160LL,
2933245707834261LL,
28085287524564992LL
};
ll solve(ll ub){
  if(ub==10000000000000000000LL)--ub;
  if(ub<1)return 0;
  int i,j;
  A=0;
  deque<int> DIG;
  while(ub>0){DIG.push_front(ub%10);ub/=10;}
  for(i=1;i<20;++i){
   ogr[i].clear();
   for(j=0;j<i;++j)ogr[i].push_back(9);
                   }
  ogr[DIG.size()]=DIG;
  for(i=1;i<=DIG.size();++i){
    if(i<DIG.size())A+=prec[i];
    else gen_all(i);
                            }
  return A;
}
int main(){
  fact[0]=1;
  for(int i=1;i<20;++i)fact[i]=fact[i-1]*i;
  ll a,b;
  cin>>a>>b;
  a=solve(a-1);b=solve(b);
  cout<<b-a<<'\n';
  return 0;
}
