// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define popcnt(x) __builtin_popcount(x)
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;
// const int inf = 1e9;
const ll inf = 1e18;
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};

void chmin(double& a, double b) { a = min(a, b); }

// const int mod = 998244353;
const int mod = 1000000007;
struct mint {
  ll x;  // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

mint dodp(string& str, bool eq) {
  vector dp(2, vector<mint>(24));
  vector pdp(2, vector<mint>(24));
  int s = 0, t = 0;
  rep(i, str.size()) {
    int a = str[i] - '0';
    swap(dp, pdp);

    rep(f, 2) rep(j, 24) {
      mint pre = pdp[f][j];
      if (pre.x == 0) continue;
      pdp[f][j] = 0;
      rep(d, 10) {
        int nf = f, nj = (j * 10 + d) % 24;
        if (d == 3) nf = 1;
        dp[nf][nj] += pre;
      }
    }

    for (int d = (i == 0); d < a; d++) {
      int nf = t;
      if (d == 3) nf = 1;
      int nj = (s * 10 + d) % 24;
      dp[nf][nj] += 1;
    }

    if (i) {
      for (int d = 1; d < 10; d++) dp[d == 3][d] += 1;
    }

    s = (s * 10 + a) % 24;
    if (a == 3) t = 1;
  }

  mint res;
  for (int j = 3; j < 24; j += 3) res += dp[0][j];
  rep(j, 24) {
    if (j % 8 == 0) continue;
    res += dp[1][j];
  }
  if (eq && s % 8 && (t || (s % 3 == 0))) res += 1;

  return res;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  string a, b;
  cin >> a >> b;
  mint ans = dodp(b, true) - dodp(a, false);
  cout << ans << endl;

  return 0;
}