1 #include <cstring>
 2 #include <algorithm>
 3 #include <cstdio>
 4 #include <cstdlib>
 5 #include <cmath>
 6 using namespace std;
 7 int A,B;
 8 int a[12],dp[12][10];
 9 int dfs(int d,int num,bool zero,bool full){
10     if (!zero&&!full&&dp[d][num]!=-1)
11         return dp[d][num];
12     if (!d)
13         return 1;
14     int top=full?a[d]:9;
15     int ans=0;
16     for (int i=0;i<=top;i++){
17         if (!zero&&abs(num-i)<2)
18             continue;
19         ans+=dfs(d-1,i,zero&&!i,full&&i==top);
20     }
21     if (!zero&&!full)
22         dp[d][num]=ans;
23     return ans;
24 }
25 int solve(int n){
26     if (!n)
27         return 1;
28     int d=0;
29     while (n)
30         a[++d]=n%10,n/=10;
31     return dfs(d,0,1,1);
32 }
33 int main(){
34     scanf("%d%d",&A,&B);
35     memset(dp,-1,sizeof dp);
36     printf("%d",solve(B)-solve(A-1));
37     return 0;
38 }