#include <bits/stdc++.h>
using namespace std;
const int inf = 0x7fffffff;
void io() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout.precision(15);
}
long long mulmod(long long a, long long b, long long m) {
  long long q = (long long)(((long double)a * (long double)b) / (long double)m);
  long long r = a * b - q * m;
  if (r > m) r %= m;
  if (r < 0) r += m;
  return r;
}
template <typename T>
T power(T e, T n, T m) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = mod(x * p, m);
    p = mod(p * p, m);
    n >>= 1;
  }
  return x;
}
template <typename T>
T power(T e, T n) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = x * p;
    p = p * p;
    n >>= 1;
  }
  return x;
}
template <typename T>
T InverseEuler(T a, T m) {
  return (a == 1 ? 1 : power(a, m - 2, m));
}
template <typename T>
T gcd(T a, T b) {
  return (!b) ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  return (a * (b / gcd(a, b)));
}
template <typename T>
T Mod(T a, T b) {
  while (a < 0) a += b;
  return a % b;
}
int exEuler(int a, int b, int &x, int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int x1, y1;
  int g = exEuler(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return g;
}
int cnt[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
long long seg(long long n) {
  long long ret = 0;
  while (n) {
    ret += cnt[n % 10];
    n /= 10;
  }
  return ret;
}
int main(int argc, char *argv[]) {
  io();
  long long a, b;
  cin >> a >> b;
  long long ans = 0;
  for (__typeof(b) i = a; i <= b; ++i) {
    ans += seg(i);
  }
  cout << ans << '\n';
  return 0;
}
