#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

const int mod = int(1e9) + 7;

i64 f(string s) {
  int n = s.size();
  vector<vector<vector<vector<vector<i64>>>>> dp(n+1, vector<vector<vector<vector<i64>>>>(2, vector<vector<vector<i64>>>(2, vector<vector<i64>>(3, vector<i64>(8)))));
  dp[0][0][0][0][0] = 1;
  for(int i : range(n)) {
    for(int j : range(2)) {
      for(int k : range(24)) {
        for(int d : range(j?10:s[i]-'0'+1)) {
          int flag = j | d < s[i] - '0';
          int x = k * 10 + d;
          dp[i+1][flag][d==3][x%3][x%8] += dp[i][j][0][k%3][k%8];
          dp[i+1][flag][d==3][x%3][x%8] %= mod;
          dp[i+1][flag][1]   [x%3][x%8] += dp[i][j][1][k%3][k%8];
          dp[i+1][flag][1]   [x%3][x%8] %= mod;
        }
      }
    }
  }
  i64 res = 0;
  for(int j : range(2)) {
    for(int k8 : range(1, 8)) {
      for(int k3 : range(3)) {
        res += dp[n][j][1][k3][k8];
        res %= mod;
      }
      res += dp[n][j][0][0][k8];
      res %= mod;
    }
  }
//  return (res - 1 + mod) % mod;
  return res;
}

void minus1(string &s) {
  int n = s.size();
  for(int i=n-1; i>=0; i--) {
    if(s[i] == '0') { s[i] = '9'; }
    else { s[i] -= 1; break; }
  }
}

int main(void) {
  string a, b; cin >> a >> b;
  minus1(a);
  i64 res = f(b) - f(a);
  printf("%d\n", int((res + mod) % mod));
  return 0;
}