#include <iostream>
#include <algorithm>
using namespace std;
bool chk(int x)
{
	int a[8] = {0,0,0,0,0,0,0,0};
	int cur = 0;
	while(x > 0)
	{
		a[++cur] = x % 10;
		x /= 10;
	}
	sort(a + 1, a + cur + 1);
	bool f = 1;
	if(a[1] != 0) f = 0;
	for(int i = 2; i <= cur; i++)
	{
		if(a[i] - a[i-1] != 1) f = 0;
	}
	return f;
}
int main()
{
	int a, b;
	cin >> a >> b;
	int cnt = 0;
	for(int i = a; i <= b; i++)
	{
		if(chk(i)) cnt++;
	}
	cout << cnt;
	return 0;
}