import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def innum(a):
    n = len(a)
    res = 0
    if int(a[:2]) == 12: res += int(a[2:]) + 1
    elif int(a[:2]) > 12: res += 10 ** (n - 2)
    for i in range(1, n - 1):
        if int(a[i:i + 2]) < 12:
            res += int(a[:i]) * 10 ** (n - i - 2)
        elif int(a[i:i + 2]) == 12:
            res += int(a[:i]) * 10 ** (n - i - 2) + 1
            if i + 2 < n: res += int(a[i + 2:])
        else:
            res += (int(a[:i]) + 1) * 10 ** (n - i - 2)
    return res

def cnt22(a):
    res = 1
    n = len(a)
    if n == 2:
        if int(a) < 22: return 1
        else: return 2
    if int(a[0]) < 2: res += int("1" * (n - 2))
    elif int(a[0]) == 2:
        res += int("1" * (n - 2)) + int(a[1:n - 1]) + 1
        if int(a[-1]) < 2: res -= 1
    else: res += int("1" * (n - 1))
    return res

def from1(a):
    if len(a) == 1:
        if int(a) < 2: return 0
        else: return 1
    res1 = innum(a)
    res2 = cnt22(a)
    # print(a,res1,res2)
    return res1 + res2

def main():
    a, b = input().split()
    ans = from1(b) - from1(str(int(a) - 1))
    if a[0] == a[-1] == "2":
        ans -= 1
    print(ans)

main()