6

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[15],b[15],dp[15];

ll dfs(ll pos,bool limit)
{
	if(pos==0) return 1;
	if(!limit&&dp[pos]!=-1) return dp[pos];
	
	ll up=limit?a[pos]:9;
	ll res=0;
	for(int i=0;i<=up;i++)
	{
		if(i==3) continue;
		res+=dfs(pos-1,limit&&i==up);
	}
	if(!limit) dp[pos]=res;
	return res;
}

ll solve(ll x)
{
	ll pos=0;
	memset(a,0,sizeof(a));
	ll xx=x;
	while(x)
	{
		a[++pos]=x%10;
		x/=10;
	}
	ll tmp=dfs(pos,true);
	return xx+1-tmp;
}

int main()
{
	ll n,m;
	cin>>n>>m;
	memset(dp,-1,sizeof(dp));
	cout<<solve(m)-solve(n-1);
}