#include<bits/stdc++.h>
using namespace std;
#define il inline
#define rg register
#define ll long long
#define rp(i,x,y) for(rg ll i=x;i<=y;++i)
#define my(i,x,y) for(rg ll i=x;i>=y;--i)

const ll L=12,lq=-20031016;
ll a[L],dp[L][10];

il ll read()
{
    rg char ch=getchar();rg ll x=0;rg bool y=1;
    while(ch!='-' && (ch>'9' || ch<'0'))ch=getchar();
    if(ch=='-')ch=getchar(),y=0;
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^'0'),ch=getchar();
    return y?x:-x;
}
ll dfs(ll pos,ll last,bool limit)
{ 
    if(!pos)return 1;   
    if(last>0)if(!limit && dp[pos][last]!=-1)return dp[pos][last];
    rg ll up=limit?a[pos]:9,as=0,tmp;
    rp(i,0,up){if(abs(last-i)<2)continue;tmp=i;if((last==lq) && (!tmp))tmp=lq;as+=dfs(pos-1,tmp,limit && tmp==a[pos]);}
    if(!limit && last>0)dp[pos][last]=as;
    return as;
}
il ll solve(ll x)
{
    rg ll pos=0;
    while(x){a[++pos]=x%10;x/=10;}
    return dfs(pos,lq,true);
}

int main()
{
    memset(dp,-1,sizeof(dp));ll x=read(),y=read();printf("%lld\n",solve(y)-solve(x-1));
    return 0;
}