void main() {
  import std.stdio, std.string, std.conv, std.algorithm;

  auto args = readln.split.to!(char[][]);
  const int MOD = 10 ^^ 9 + 7;
  int solve(char[] n) {
    int[] pow10mod3 = [1];
    int[] pow10mod8 = [1];
    foreach (_; 0 .. n.length) {
      pow10mod3 ~= pow10mod3[$ - 1] * 10 % 3;
      pow10mod8 ~= pow10mod8[$ - 1] * 10 % 8;
    }
    int f(size_t i, bool less, bool ok, int mod3, int mod8) {
      if (i == n.length) {
        return (ok || mod3 == 0) && (mod8 > 0);
      } else {
        auto digit = less ? 9 : n[i] - '0';
        int ret = 0;
        for (int d = 0; d <= digit; d++) {
          auto l = less || (d < digit);
          auto o = ok || (d == 3);
          auto m3 = (mod3 + d * pow10mod3[n.length - i - 1]) % 3;
          auto m8 = (mod8 + d * pow10mod8[n.length - i - 1]) % 8;
          (ret += f(i + 1, l, o, m3, m8)) %= MOD;
        }
        return ret;
      }
    }

    return f(0, 0, 0, 0, 0);
  }

  bool yes(char[] n) {
    auto m8 = reduce!((res, ch) => (res + (ch - '0')) % 8)(0, n);
    if (m8 == 0) {
      return false;
    } else if (n.count('3') > 0) {
      return true;
    } else {
      auto m3 = reduce!((res, ch) => (res + (ch - '0')) % 3)(0, n);
      return m3 == 0;
    }
  }

  auto res = (solve(args[1]) - solve(args[0]) + MOD) % MOD;
  writeln(res + yes(args[0]));
}

void rd(T...)(ref T x) {
  import std.stdio : readln;
  import std.string : split;
  import std.conv : to;

  auto l = readln.split;
  assert(l.length == x.length);
  foreach (i, ref e; x)
    e = l[i].to!(typeof(e));
}