#include<bits/stdc++.h>
using namespace std;

int a[105];
bool dg(int nn)
{
	int n = nn;
	for (int i = 0; i <= 104; i++)
		a[i] = 0;
	int sum = 0;
	while (n != 0)
	{
		sum++;
		a[sum] = (n % 10);
		n /= 10;
	}
	sort(a + 1, a + sum + 1);
	for (int i = 1; i <= sum; i++)
		if (a[i] != (i - 1)) return 0;
	return 1;
}

int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	if (n > m) swap(n, m);
	int sum = 0;
	for (int i = n; i <= m; i++)
		if (dg(i)) sum++;
	printf("%d\n", sum);
	return 0;
}