#include <bits/stdc++.h>
using namespace std;
long long int M = 1000000007;
long long int min(long long int a, long long int b, long long int c,
                  long long int d) {
  long long int arr[4] = {a, b, c, d};
  sort(arr, arr + 4);
  return arr[0];
}
long long int max(long long int a, long long int b, long long int c,
                  long long int d) {
  long long int arr[4] = {a, b, c, d};
  sort(arr, arr + 4);
  return arr[3];
}
long long int gcd(long long int a, long long int b) {
  if (b < a) {
    int temp = a;
    a = b;
    b = temp;
  }
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (a * b / gcd(a, b));
}
vector<long long int> getprimes() {
  vector<long long int> pl(101, 1);
  for (int i = 2; i <= 100; i++) {
    if (pl[i] == 1) {
      for (int j = 2 * i; j <= 100; j += i) {
        pl[j] = 0;
      }
    }
  }
  return pl;
}
double distsqrd(double x1, double y1, double x2, double y2) {
  return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
}
long long int fact(long long int first) {
  long long int ans = 1;
  if (first == 0) {
    return 1;
  }
  while (first > 0) {
    ans = (ans * first) % 1000000007;
    first--;
  }
  return ans % 1000000007;
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      ans *= a;
      ans = ans;
    }
    b /= 2;
    a *= a;
    a = a;
  }
  return ans;
}
long long int mod(long long int a, long long int b) {
  return (((a % b) + b) % b);
}
vector<int> getbinary(int first) {
  vector<int> bin(16, 0);
  int iter = 0;
  while (first > 0) {
    if (first % 2 == 1) {
      bin[iter] = 1;
    } else {
      bin[iter] = 0;
    }
    iter++;
    first /= 2;
  }
  return bin;
}
long long int f(string s) {
  int ld = s[0] - '0';
  int n = s.size();
  int rd = s[n - 1] - '0';
  long long int ret = 0;
  for (int d = 1; d <= n; d++) {
    if (d == n) {
      long long int tomul = 0;
      for (int i = 1; i < n - 1; i++) {
        tomul *= 10;
        tomul += s[i] - '0';
      }
      for (int i = 1; i < ld; i++) {
        ret += power(10, d - 2);
      }
      if (ld <= rd) {
        ret += tomul + 1;
      } else {
        ret += tomul;
      }
    } else {
      ret += 9 * power(10, d - 2);
    }
  }
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string l, r;
  cin >> l >> r;
  long long int lnum = 0;
  for (int i = 0; i < l.size(); i++) {
    lnum *= 10;
    lnum += l[i] - '0';
  }
  lnum--;
  string lnew;
  while (lnum > 0) {
    lnew += (lnum % 10 + '0');
    lnum /= 10;
  }
  reverse(lnew.begin(), lnew.end());
  cout << f(r) - f(lnew) << endl;
}
