package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

var iost *Iost

type Iost struct {
	Scanner *bufio.Scanner
	Writer  *bufio.Writer
}

func NewIost(fp io.Reader, wfp io.Writer) *Iost {
	const BufSize = 2000005
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, BufSize), BufSize)
	return &Iost{Scanner: scanner, Writer: bufio.NewWriter(wfp)}
}
func (i *Iost) Text() string {
	if !i.Scanner.Scan() {
		panic("scan failed")
	}
	return i.Scanner.Text()
}
func (i *Iost) Atoi(s string) int                 { x, _ := strconv.Atoi(s); return x }
func (i *Iost) GetNextInt() int                   { return i.Atoi(i.Text()) }
func (i *Iost) Atoi64(s string) int64             { x, _ := strconv.ParseInt(s, 10, 64); return x }
func (i *Iost) GetNextInt64() int64               { return i.Atoi64(i.Text()) }
func (i *Iost) Atof64(s string) float64           { x, _ := strconv.ParseFloat(s, 64); return x }
func (i *Iost) GetNextFloat64() float64           { return i.Atof64(i.Text()) }
func (i *Iost) Print(x ...interface{})            { fmt.Fprint(i.Writer, x...) }
func (i *Iost) Printf(s string, x ...interface{}) { fmt.Fprintf(i.Writer, s, x...) }
func (i *Iost) Println(x ...interface{})          { fmt.Fprintln(i.Writer, x...) }
func isLocal() bool                               { return os.Getenv("NICKEL") == "BACK" }
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	if isLocal() {
		fp, _ = os.Open(os.Getenv("WELL_EVERYBODY_LIES_TOO_MUCH"))
	}
	iost = NewIost(fp, wfp)
	defer func() {
		iost.Writer.Flush()
	}()
	solve()
}
func solve() {
	l := iost.GetNextInt()
	r := iost.GetNextInt()
	iost.Println(f(r) - f(l-1) + g(r-1) - g(l))
}
func f(r int) int {
	rr := make([]int, 0)
	for r > 0 {
		rr = append(rr, r%10)
		r /= 10
	}
	a := 0
	n := len(rr)
	b := n - 1
	for a < b {
		rr[a], rr[b] = rr[b], rr[a]
		a++
		b--
	}
	dp := make([][2][2]int, n+1)
	cnt := make([][2][2]int, n+1)
	cnt[n][0][0] = 1
	ans := 0
	for i := n - 1; i >= 0; i-- {
		for j := 0; j < 2; j++ {
			for k := 0; k < 2; k++ {
				for d := 0; d < 10; d++ {
					tj := 0
					if rr[i]-j < d {
						tj = 1
					}
					tk := 0
					if d == 2 {
						tk = 1
					}
					add := 0
					if d == 1 && k == 1 {
						add = cnt[i+1][j][k]
					}
					dp[i][tj][tk] += dp[i+1][j][k] + add
					cnt[i][tj][tk] += cnt[i+1][j][k]
					if d == 0 {
						continue
					}
					if i > 0 || tj == 0 {
						ans += dp[i+1][j][k] + add
					}
				}
			}
		}
	}
	return ans
}
func g(r int) int {
	rr := make([]int, 0)
	for r > 0 {
		rr = append(rr, r%10)
		r /= 10
	}
	a := 0
	n := len(rr)
	b := n - 1
	for a < b {
		rr[a], rr[b] = rr[b], rr[a]
		a++
		b--
	}
	dp := make([][2]int, n+1)
	enable := make([][2]int, n)
	enable[n-1][0] = 1
	enable[n-1][1] = 1
	for i := 0; i < n-1; i++ {
		enable[i][1] = 9
	}
	dp[n][0] = 1
	ans := 0
	for i := n - 1; i >= 0; i-- {
		for j := 0; j < 2; j++ {
			for d := enable[i][0]; d <= enable[i][1]; d++ {
				tj := 0
				if rr[i]-j < d {
					tj = 1
				}
				dp[i][tj] += dp[i+1][j]
				if d != 2 {
					continue
				}
				if i > 0 || tj == 0 {
					ans += dp[i+1][j]
				}
			}
		}
	}
	return ans
}