import sys
input = sys.stdin.readline

sys.set_int_max_str_digits(10**6)

mod=10**9+7

A0,B0=list(map(int,input().split()))

A=list(map(int,list(str(A0-1))))
B=list(map(int,list(str(B0))))

DP=[[[0]*10 for j in range(2)] for i in range(2)]
# DP[i][j][k]で桁が一致, 一つ前が1かどうか、12の個数。

DP[1][0][0]=1

for i in range(len(A)):
    a=A[i]
    NDP=[[[0]*10 for j in range(2)] for i in range(2)]

    for j in range(2):
        for k in range(2):
            for l in range(9):
                if j==1:
                    for to in range(a+1):
                        if to==a:
                            if to==1:
                                NDP[1][1][l]+=DP[j][k][l]
                            elif to==2:
                                if k==1:
                                    NDP[1][0][l+1]+=DP[j][k][l]
                                else:
                                    NDP[1][0][l]+=DP[j][k][l]
                            else:
                                NDP[1][0][l]+=DP[j][k][l]
                        else:
                            if to==1:
                                NDP[0][1][l]+=DP[j][k][l]
                            elif to==2:
                                if k==1:
                                    NDP[0][0][l+1]+=DP[j][k][l]
                                else:
                                    NDP[0][0][l]+=DP[j][k][l]
                            else:
                                NDP[0][0][l]+=DP[j][k][l]
                else:
                    for to in range(10):
                        if to==1:
                            NDP[0][1][l]+=DP[j][k][l]
                        elif to==2:
                            if k==1:
                                NDP[0][0][l+1]+=DP[j][k][l]
                            else:
                                NDP[0][0][l]+=DP[j][k][l]
                        else:
                            NDP[0][0][l]+=DP[j][k][l]
    DP=NDP
                
ANS0=0
for j in range(2):
    for k in range(2):
        for l in range(9):
            ANS0+=DP[j][k][l]*l

#print(ANS0)


DP=[[[0]*10 for j in range(2)] for i in range(2)]
# DP[i][j][k]で桁が一致, 一つ前が1かどうか、12の個数。

DP[1][0][0]=1

for i in range(len(B)):
    a=B[i]
    NDP=[[[0]*10 for j in range(2)] for i in range(2)]

    for j in range(2):
        for k in range(2):
            for l in range(9):
                if j==1:
                    for to in range(a+1):
                        if to==a:
                            if to==1:
                                NDP[1][1][l]+=DP[j][k][l]
                            elif to==2:
                                if k==1:
                                    NDP[1][0][l+1]+=DP[j][k][l]
                                else:
                                    NDP[1][0][l]+=DP[j][k][l]
                            else:
                                NDP[1][0][l]+=DP[j][k][l]
                        else:
                            if to==1:
                                NDP[0][1][l]+=DP[j][k][l]
                            elif to==2:
                                if k==1:
                                    NDP[0][0][l+1]+=DP[j][k][l]
                                else:
                                    NDP[0][0][l]+=DP[j][k][l]
                            else:
                                NDP[0][0][l]+=DP[j][k][l]
                else:
                    for to in range(10):
                        if to==1:
                            NDP[0][1][l]+=DP[j][k][l]
                        elif to==2:
                            if k==1:
                                NDP[0][0][l+1]+=DP[j][k][l]
                            else:
                                NDP[0][0][l]+=DP[j][k][l]
                        else:
                            NDP[0][0][l]+=DP[j][k][l]
    DP=NDP
                
ANS1=0
for j in range(2):
    for k in range(2):
        for l in range(9):
            ANS1+=DP[j][k][l]*l

#print(ANS1)


# 2で始まって1で終わる数
def calc(x):
    c=10
    ANS=0

    for i in range(15):
        MIN=c*2+1
        MAX=c*3+1-10

        if min(MAX,x)>=MIN:
            ANS+=(min(MAX,x)-MIN+10)//10

        c=c*10

    return ANS
            

ANS2=calc(A0-1)
ANS3=calc(B0-1)

LANS=ANS1+ANS3-ANS0-ANS2


if A0<=1 and B0>=2:
    LANS+=1
print(LANS)