#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
ll dp[10010][2][2][3][8];
ll dp2[10010][2][2][3][8];
string s,w;

int main(){
	cin >> s >> w;
	REP(i,0,10010) REP(j,0,2) REP(k,0,2) REP(l,0,3) REP(m,0,8) dp[i][j][k][l][m]=0;
	REP(i,0,10010) REP(j,0,2) REP(k,0,2) REP(l,0,3) REP(m,0,8) dp2[i][j][k][l][m]=0;
	dp[0][0][0][0][0]=1; dp2[0][0][0][0][0]=1;
	
	REP(i,0,s.size()){
		int D=s[i]-'0';
		
		REP(j,0,2){
			REP(k,0,2){
				REP(l,0,3){
					REP(m,0,8){
						REP(d,0,(j?9:D)+1){
							(dp[i+1][j|d<D][k|d==3][(l+d)%3][(2*m+d)%8]+=dp[i][j][k][l][m])%=MOD;
						}
					}
				}
			}
		}
	}
	
	REP(i,0,w.size()){
		int D=w[i]-'0';
		
		REP(j,0,2){
			REP(k,0,2){
				REP(l,0,3){
					REP(m,0,8){
						REP(d,0,(j?9:D)+1){
							(dp2[i+1][j|d<D][k|d==3][(l+d)%3][(2*m+d)%8]+=dp2[i][j][k][l][m])%=MOD;
						}
					}
				}
			}
		}
	}
	
	ll ans=0;
	REP(i,0,2) REP(j,0,2) REP(k,0,3) REP(l,0,8) if((j||k==0)&&l!=0) ans+=dp2[w.size()][i][j][k][l];
	REP(j,0,2) REP(k,0,3) REP(l,0,8) if((j||k==0)&&l!=0) ans-=dp[s.size()][1][j][k][l];
	cout << ans << endl;
	return 0;
}