#include <bits/stdc++.h>

using namespace std;
vector <char> v,r;
long long x,n,a,b,m,cnt,sum,sm,l;

set <int> se;
char d[8];

string z(int a)
{
	string s;
	if(a/10 == 0)
	{
		s[0] = a%10+'0';
	}
	else if(a/100 == 0)
	{
		s[1] = a%10+'0';
		s[0] = a/10%10+'0';
	}
	else if(a/1000 == 0)
	{
		s[2] = a%10+'0';
		s[1] = a/10%10+'0';
		s[0] = a/100 %10+'0';
		
	}
	else if(a/10000 == 0){
		s[3] = a%10+'0';
		s[2] = a/10%10+'0';
		s[1] = a/100 %10+'0';
		s[0] = a/1000%10+'0';
	}
	else if(a/100000 == 0)
	{
		s[4] = a%10+'0';
		s[3] = a/10%10+'0';
		s[2] = a/100 %10+'0';
		s[1] = a/1000%10+'0';
		s[0] = a/10000%10+'0';
	}
	else if(a/1000000 == 0)
	{
		s[5] = a%10+'0';
		s[4] = a/10%10+'0';
		s[3] = a/100 %10+'0';
		s[2] = a/1000%10+'0';
		s[1] = a/10000%10+'0';
		s[0] = a/100000%10+'0';
	}
	else
	{
		s[0] = '1';
		s[1] = '0';
		s[2] = '0';
		s[3] = '0';
		s[4] = '0';
		s[5] = '0';
		s[6] = '0';
	}
	return s; 
}
bool num(string n)
{
	v.clear();
	if(n[0] == '0')
	{
		return 0;
	}
	while(n.size() >= 1)
	{
		v.push_back(n[n.size()-1]);
		n.pop_back();
	}
		
	
	for(int i = 0;i < v.size();i++)
	{
		v[i]-='0';
	}
	
	
	sort(v.begin(),v.end());
	for(int i = 0;i < v.size();i++)
	{
		if(v[i] != i)
		{
			return 0;
		}
	}
	return 1;
}

int main()
{
	cin >> a >> b;
	for(int i = a;i <= b;i++)
	{
		if(num(z(i)))
		{
			cnt++;
		}
	}	
	cout << cnt;
 }