#include<bits/stdc++.h>
using namespace std;
int a, b, cnt;
bool pd( int k )
{
	bool f[10];
	memset( f, false, sizeof(f) );
	if ( k < 10 || k == 1000000 )
	{
		return 0;
	}
	else if ( k > 9 && k < 100 )
	{
		for( int i = 1; i <= 2; i++ )
		{
			f[k % 10] = true;
			k /= 10;
		}
		for ( int i = 0; i < 2; i++ )
		{
			if ( f[i] == false )
			{
				return 0;
			}
		}
		return 1;
	}
	else if ( k < 1000 )
	{
		for( int i = 1; i <= 3; i++ )
		{
			f[k % 10] = true;
			k /= 10;
		}
		for ( int i = 0; i < 3; i++ )
		{
			if ( f[i] == false )
			{
				return 0;
			}
		}
		return 1;
	}
	else if ( k < 10000 )
	{
		for( int i = 1; i <= 4; i++ )
		{
			f[k % 10] = true;
			k /= 10;
		}
		for ( int i = 0; i < 4; i++ )
		{
			if ( f[i] == false )
			{
				return 0;
			}
		}
		return 1;
	}
	else if ( k < 100000 )
	{
		for( int i = 1; i <= 5; i++ )
		{
			f[k % 10] = true;
			k /= 10;
		}
		for ( int i = 0; i < 5; i++ )
		{
			if ( f[i] == false )
			{
				return 0;
			}
		}
		return 1;
	}
	else if ( k < 1000000 )
	{
		for( int i = 1; i <= 6; i++ )
		{
			f[k % 10] = true;
			k /= 10;
		}
		for ( int i = 0; i < 6; i++ )
		{
			if ( f[i] == false )
			{
				return 0;
			}
		}
		return 1;
	}
}
int main()
{
	cin >> a >> b;
	for ( int i = a; i <= b; i++ )
	{
		if ( pd( i ) )
		{
			cnt++;
		}
	}
	cout << cnt << endl;
	return 0;
}