#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define NMAX 100010

int minc;

ll power(ll base, int exp)
{
	ll res;

	for(res = 1; exp; exp >>= 1)
	{
		if(exp & 1) res *= base;
		base *= base;
	}

	return res;
}

ll query(ll a)
{
	// how many nums in [1, a) have digits only minc, minc + 1, ..., 9

	//cerr << "query " << a << " - minc = " << minc << '\n';

	int i, lg, v[30];
	ll aux, ans;

	for(lg = 0, aux = a; aux; aux /= 10, ++lg) v[lg] = aux % 10;

	//cerr << "lg = " << lg << '\n';

	for(ans = 0, i = 1; i < lg; ++i)
		ans += power(10 - minc, i);

	//cerr << "ans = " << ans << '\n';

	reverse(v, v + lg);
	for(i = 0; i < lg; ++i)
	{
		for(int c = minc; c < v[i]; ++c)
			ans += power(10 - minc, lg - 1 - i);

		if(v[i] < minc) break;
	}

	return ans;
}

int main()
{
	#ifndef ONLINE_JUDGE
	freopen("data.in", "r", stdin);
	freopen("data.out", "w", stdout);
	#endif

	int i, n;
	ll a, b, aux;

	cin >> a >> b;

	if(a >= 10) return cout << 0 << '\n', 0;

	for(minc = 9, aux = a; aux; aux /= 10)
		minc = min(minc, (int)(aux % 10));

	cout << query(b) - query(a) << '\n';

	return 0;
}