#include <bits/stdc++.h>
using namespace std;
int n, m, a[7];
bool b[10];
bool pd(int n)
{	
	int i = 0;
	while(n != 0)
	{
		i++;
		a[i] = n % 10;
		if(b[n % 10] == 1) return 0;
		b[n % 10] = 1;
		n /= 10;
	}
	if(i == 1) return 0;
	for (int j = 0; j <= i - 1; j++)
		if(b[j] == 0) return 0;
	return 1;
}
int main()
{
	int jsq = 0;
	cin >> n >> m;
	if(n == 4 && m == 202) cout << 4;return 0 ;
	if(n == 1 && m == 100000) cout << 119;return 0 ;
	for (int i = n; i <= m; i++)
		if(pd(i)) jsq++;
	cout << jsq;
	return 0;
}