求调0pts

#include<bits/stdc++.h>
//因为爱，所以坚持
using namespace std;
#define I return
#define love 0
#define coding
#define int long long

int l,r,f[25][25],sum[25],a[25];

int work(int x){
	int cnt = 0,ans = 0;
	for(;x;x/=10) a[++cnt] = x%10;
	ans+=sum[cnt-1];
	for(int i = 1;i < a[cnt];i++) ans+=f[cnt][i];
	for(int i = cnt-1;i;i--){
		for(int j = 0;j < a[i];j++)
			if(abs(j-a[i+1]) > 1) ans+=f[i][j];
		if(abs(a[i+1]-a[i]) < 2) break;
	}
	return ans;
}
inline long long rd(){
	int x = 0,f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9'){
		x = x*10+ch-'0';
		ch = getchar();
	}
	return x*f;
}
inline void wt(long long x){
    if(x < 0){
        putchar('-');
        x = -x;
    }
    if(x > 9) wt(x/10);
    putchar(x%10+'0');
}

signed main(){
//	freopen("data.in","r",stdin);
//	freopen("task.out","w",stdout);
	l = rd(),r = rd();
	for(int i = 0;i < 10;i++) f[1][i] = 1;
	sum[0] = 1,sum[1] = 10;
	for(int i = 2;i <= 15;i++){
		for(int j = 0;j < 10;j++)
			for(int k = 0;k < 10;k++)
				if(abs(j-k) > 1) f[i][j]+=f[i-1][k];
		sum[i] = sum[i-1];
		for(int j = 1;j < 10;j++) sum[i]+=f[i][j];
	}
	wt(work(r+1)-work(l));
	I love coding;
}