#include <iostream>
#include <string>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <stack>
#define L(i, a, b) for (int i = a; i <= b; i++)
#define Bk(i, a, b) for (int i = a; i >= b; i--)
using namespace std;

long long Mi(int a, int b)
{
	long long ans = 1;
	L(i, 2, b)
		ans *= b;
	return ans;
}

void Solve()
{
	int a, b;
	cin >> a >> b;
	int cnt = 0;
	L(i, a, b)
	{
		int Cn[10] = {0};
		int ii = i;
		int flag = 1;
		while (ii)
		{
			int x = ii % 10;
			if (x == 0 && ii == 0)
			{
				flag = 0;
				break;
			}
			Cn[x]++;
			ii /= 10;
		}
		if (!flag)
			continue;
		L(i, 0, 9)
			if (Cn[i] > 1)
			{
				flag = 0;
				break;
			}
			else
				if (Cn[i] == 0)
					flag = 2;
				else
					if (Cn[i] && flag == 2)
					{
						flag = 0;
						break;
					}
		if (!flag)
			continue;
		cnt++;
	}
	cout << cnt << endl;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int t = 1;
//	cin >> t;
	while (t--)
		Solve();
}