#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <array>
#include <chrono>
#include <random>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#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<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define IN(a, x, b) (a<=x && x<=b)
#define IN2(a0, y, a1, b0, x, b1) (a0<=y && y<a1 && b0<=x && x<b1)
#define SHOW(d) {std::cout << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cout << #v << "\t:";for(const auto& i : v){std::cout << i << " ";}std::cout << "\n";}
#define SHOWVECTOR2(v) {std::cout << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cout << j << " ";}std::cout << "\n";}}
#define SHOWPAIRVECTOR2(v) {std::cout << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cout<<'('<<j.first<<", "<<j.second<<") ";}std::cout << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& i:v){std::cout<<'('<<i.first<<", "<<i.second<<") ";}std::cout<<"\n";}
#define CHECKTIME(state) {auto start=std::chrono::system_clock::now();state();auto end=std::chrono::system_clock::now();auto res=std::chrono::duration_cast<std::chrono::nanoseconds>(end-start).count();std::cerr<<"[Time:"<<res<<"ns  ("<<res/(1.0e9)<<"s)]\n";}
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cout << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cout << tmp.front() << "\n";tmp.pop();}std::cout << "\n";}

//#define int ll
using ll = long long;
constexpr int INFINT = 1 << 30;
constexpr ll INFLL = 1LL << 60;
constexpr double EPS = 0.0000001;
constexpr int MOD = 1000000007;

// dp[i][j][k][l][m] = 上からi桁見て、a未満が確定して(j:いる/いない)で、
//                     3が含まれて(j:いる/いない)で、値のmod 3の値がkとなり、
//                     値のmod 8の値がlとなる数の総数
ll dp_a[100000][2][2][3][8];
ll dp_b[100000][2][2][3][8];

int main() {
	INIT;
	VAR(std::string, a, b);
	// 0 <= n <= aについて
	int n_a = a.size();
	dp_a[0][0][0][0][0] = 1;
	REP(i, n_a) REP(j, 2) REP(k, 2) REP(l, 3) REP(m, 8) {
		int lim = j ? 9 : a[i] - '0';
		REP(d, lim + 1) {
			ll& next = dp_a[i + 1][j || d < lim][k || d == 3][(l + d) % 3][(2 * m + d) % 8];
			 next += dp_a[i][j][k][l][m];
			 next %= MOD;
		}
	}

	ll ans_a = 0;
	REP(j, 2) REP(k, 2) REP(l, 3) REP(m, 8) {
		if ((k || l == 0) && (m != 0)) {
			ans_a += dp_a[n_a][j][k][l][m];
			ans_a %= MOD;
		}
	}
	// a が条件を満たすなら ans_a から引く
	{
		int sum = 0;
		bool isAho = false;
		REP(i, n_a) {
			sum += a[i] - '0';
			if (a[i] == '3') {
				isAho = true;
				break;
			}
		}
		if (sum % 3 == 0) isAho = true;
		int bottom3 = std::stoi(a.substr(std::max((int)a.size() - 3, 0)));
		if (isAho && (bottom3 % 8 != 0)) --ans_a;
	}
	// 0 <= n <= bについて
	int n_b = b.size();
	dp_b[0][0][0][0][0] = 1;
	REP(i, n_b) REP(j, 2) REP(k, 2) REP(l, 3) REP(m, 8) {
		int lim = j ? 9 : b[i] -'0';
		REP(d, lim + 1) {
			ll& next = dp_b[i + 1][j || d < lim][k || d == 3][(l + d) % 3][(2 * m + d) % 8];
			next += dp_b[i][j][k][l][m];
			next %= MOD;
		}
	}

	ll ans_b = 0;
	REP(j, 2) REP(k, 2) REP(l, 3) REP(m, 8) {
		if ((k || l == 0) && (m != 0)) {
			ans_b += dp_b[n_b][j][k][l][m];
			ans_b %= MOD;
		}
	}
	// 結果
	ll ans = ans_b - ans_a;
	ans += MOD;
	ans %= MOD;
	OUT(ans)BR;
	return 0;
}