#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
#define MOD 1000000007

template <class T> void add(T &a, T b) { a = (a + b) % MOD; }

ll solve(string S) {
  ll dp[10005][2][3][8][2] = {};
  dp[0][0][0][0][0] = 1;
  int len = S.size();
  rep(i, len) rep(j, 2) rep(k, 3) rep(l, 8) rep(m, 2) {
    int x = j ? 9 : S[i] - '0';
    rep(d, x + 1) {
      add(dp[i + 1][j || d < x][(k + d) % 3][(10 * l + d) % 8][m || d == 3],
          dp[i][j][k][l][m]);
    }
  }
  ll ans = 0;
  rep(j, 2) rep(k, 3) rep(l, 8) rep(m, 2) {
    if (l == 0)
      continue;
    if (k == 0 || m)
      add(ans, dp[len][j][k][l][m]);
  }
  return ans;
}

bool hasThree(int num) {
  while (num > 0) {
    if (num % 10 == 3)
      return true;
    num /= 10;
  }
  return false;
}

bool isVailed(string S) {
  bool three = false;
  int num;
  if (S.size() > 3)
    num = stoi(S.substr(S.size() - 3, S.size()));
  else
    num = stoi(S);
  if (num % 8 == 0)
    return false;
  return (num % 3 == 0) || hasThree(num);
}

int main() {
  string A, B;
  cin >> A >> B;
  ll ans = solve(B) - solve(A) + isVailed(A) + MOD;
  ans %= MOD;
  cout << ans << endl;
  return 0;
}