//思路与1081基本一致，通过abs限定绝对值

include [HTML_REMOVED]

include [HTML_REMOVED]

include [HTML_REMOVED]

include [HTML_REMOVED]

include [HTML_REMOVED]

using namespace std;

const int N = 35;

int f[N][N];

void init()
{
for(int i = 0; i <= 9; i)
f[1][i] = 1;
for(int i = 2; i < N; i)
{
for(int j = 0; j <= 9; j)
{
for(int k = 0; k <= 9; k)
{
if(abs(k - j) >= 2)
f[i][j] += f[i - 1][k];
}
}
}
}

int dp(int n)
{
if(n == 0)
return 0;
int res = 0;
int last = -10;//0 - 10
vector[HTML_REMOVED] nums;
while(n)
nums.push_back(n % 10), n /= 10;
for(int i = nums.size() - 1; i >= 0; i–)
{
int x = nums[i];
for(int j = (i == nums.size() - 1); j < x; j++)
if(abs(j - last) >= 2)
res += f[i+1][j];

    if(abs(x - last) < 2) 
        break;
    last = x;

    if(i == 0) 
        res ++;
}

for(int i = 1; i <= nums.size() - 1; i++)
{
    for(int j = 1; j <= 9; j++)
    {
        res += f[i][j];
    }
}

return res;

}
int main()
{
init();
int l, r;
cin >> l >> r;
cout << dp(r) - dp(l - 1) << endl;
return 0;
}