#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define FORD(x,y,z) for(int x=y;x>=z;x--)
#define MSET(x,y) memset(x,y,sizeof(x))
#define FOR(x,y) for(__typeof(y.begin()) x=y.begin();x!=y.end();x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 
void RI(){}
template<typename... T>
void RI( int& head, T&... tail ) {
    scanf("%d",&head);
    RI(tail...);
}
using namespace std;
typedef long long LL;
LL n,m,pw[30];
LL dp[32][2][3],cnt[32][2][3];
char buf[100];
LL solve2(LL x)
{
	if(x<10) return 0;
	
	sprintf(buf, "%lld", x);
	int len = strlen(buf);
	MSET(dp,0);
	MSET(cnt,0);
	REP(i,0,len-1) buf[i]-='0';

	REP(i,0,buf[0]) cnt[0][i==buf[0]][i==1]++;

	int ni,nj,nk;
	REP(i,0,len-2)REP(j,0,1)REP(k,0,2)if(cnt[i][j][k]!=0)
	{
		REP(num,0,9)
		{
			if(j==1 && num>buf[i+1]) continue;

			ni = i+1;
			nj = (j==1 && num==buf[i+1]);
			
			nk = 0;
			if(num==1) nk=1;
			if(k==1 && num==2) nk=2;

			//cnt
			cnt[ni][nj][nk] += cnt[i][j][k];

			//dp
			if(dp[ni][nj][nk]==-1) dp[ni][nj][nk]=0;
			dp[ni][nj][nk] += dp[i][j][k];
			if(nk==2) dp[ni][nj][nk]+=cnt[i][j][k];
		}
	}

	LL re=0;
	REP(j,0,1)REP(k,0,2) re+=dp[len-1][j][k];
	return re;
}
LL solve(LL x)
{
	LL re = solve2(x);

	LL a,b;
	LL l,r,mid;

	REP(dig,1,18)
	{
		a=1, b=2;
		if(dig>1)
		{
			a += pw[dig-1]*2;
			b += pw[dig-1]*2;
		}
		if(b>x) break;

		if(dig<=2) re++;
		else
		{
			l=0, r=pw[dig-2]-1;
			while(l<r-1)
			{
				mid = (l+r)/2;
				if(b+mid*10 <= x) l=mid;
				else r=mid-1;
			}
			if(l==r-1 && b+r*10<=x) l++;
			re += l+1;
		}
	}
	return re;
}
int head(LL x)
{
	while(x>10) x/=10;
	return (int)x;
}
int main()
{
	pw[0]=1;
	REP(i,1,29) pw[i]=pw[i-1]*10;

	while(~scanf("%lld %lld",&n,&m))
	{
		LL ans = solve(m)-solve(n-1);

		int hn = head(n);
		int tn = (n-1)%10;
		if(tn==1 && hn==2) ans--;
		printf("%lld\n",ans);
	}
	return 0;
}