#include <bits/stdc++.h>
using namespace std;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define MP(x,y) make_pair((x), (y))
#define MIN(a,b) (a < b ? a : b)
#define MAX(a,b) (a > b ? a : b)
#define AMIN(a,b) if(b < a) (a) = (b)
#define AMAX(a,b) if(b > a) (a) = (b)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define bitcount(b) __builtin_popcount(b)
#define GCD(a,b) (__gcd(a,b))
#define GCD3(a,b,c) (GCD(GCD(a,b), c))
#define LCM(a,b) (a/GCD(a,b)*b)
#define LCM3(a,b,c) LCM(LCM(a,b),c)
#define MOD 1000000007
typedef long long ll;
// -------------------------------------

int dp[101010][2][2][3][8];  // pos, less, has3, mod3, mod8

int sekai(string A) {
  ZERO(dp);
  int n = A.length();

  dp[0][0][0][0][0] = 1;
  REP(i, n) REP(j, 2) REP(k, 2) REP(l, 3) REP(m, 8) {
    int lim = j ? 9 : A[i] - '0';
    REP(d, lim + 1) {
      (dp
       [i + 1]
       [j || d < lim]
       [k || d == 3]
       [(l + d) % 3]
       [(m * 10 + d) % 8] += dp[i][j][k][l][m]) %= MOD;
    }
  }

  int ans = 0;
  REP(j, 2) REP(k, 2) REP(l, 3) REP(m, 8) {
    if ((k == 1 || l == 0) && m != 0) (ans += dp[n][j][k][l][m]) %= MOD;
  }
  return ans;
}

string dec(string S) {
  int bollow = 1;
  RREP(i, S.length()) {
    int p = S[i] - '0';
    if (p - bollow < 0) {
      S[i] = '9';
      bollow = 1;
    }
    else {
      S[i] = (p - bollow) + '0';
      break;
    }
  }
  return S;
}

int main() {
  string A, B;
  cin >> A;
  cin >> B;
  int ans = sekai(B) - sekai(dec(A));
  ans += MOD; ans %= MOD;
  cout << ans << '\n';

  return 0;
}