#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
// head

int dig[]={2,3,5,7};
int dp[22][58][38][26][23],g[22];
ll k;
int p[10],q[10],cnt[10],c[20][10];
char L[33],R[33];

void upd(int &a,int b) {
	a+=b;
	if (a>=mod) a-=mod;
}

int calc(char *x,bool v=false) {
	int m=strlen(x);
	VI d;
	rep(i,0,m) d.pb(x[i]-'0');
	reverse(all(d));
	int ans=g[m-1];
	rep(i,0,4) p[i]=cnt[i];
	per(i,0,m) {
		rep(j,(i==m-1),d[i]+(v&&(i==0))) {
			rep(k,0,4) q[k]=max(0,p[k]-c[j][k]);
			//printf("--- %d %d %d %d %d\n",j,q[0],q[1],q[2],q[3]);
			upd(ans,dp[i][q[0]][q[1]][q[2]][q[3]]);
		}
		rep(k,0,4) p[k]=max(0,p[k]-c[d[i]][k]);
	}
	//printf("%d\n",ans);
	return ans;
}

int main() {
	scanf("%lld%s%s",&k,L,R);
	rep(i,0,4) {
		while (k%dig[i]==0) k/=dig[i],cnt[i]++;
	}
	c[0][0]=c[0][1]=c[0][2]=c[0][3]=1000;
	rep(z,1,10) {
		int k=z;
		rep(i,0,4) {
			while (k%dig[i]==0) k/=dig[i],c[z][i]++;
		}
	}
	/*if (k!=1) {
		puts("0");
		return 0;
	}*/
	if (k!=1) {
		cnt[3]=21;
	}
	dp[0][0][0][0][0]=1;
	rep(i,1,22) {
		rep(p2,0,cnt[0]+1) rep(p3,0,cnt[1]+1) rep(p5,0,cnt[2]+1) rep(p7,0,cnt[3]+1) {
			rep(z,1,10) {
				int w=dp[i-1][max(0,p2-c[z][0])][max(0,p3-c[z][1])]
					[max(0,p5-c[z][2])][max(0,p7-c[z][3])];
				upd(dp[i][p2][p3][p5][p7],w);
				//upd(g[i],w);
			}
		}
		upd(g[i],dp[i][cnt[0]][cnt[1]][cnt[2]][cnt[3]]);
		rep(p2,0,cnt[0]+1) rep(p3,0,cnt[1]+1) rep(p5,0,cnt[2]+1) rep(p7,0,cnt[3]+1)
			upd(dp[i][p2][p3][p5][p7],dp[i-1][0][0][0][0]); // 0
		upd(g[i],g[i-1]);
	}
	//printf("%d\n",g[1]);
	//5 1 20
	int ans=calc(R,true)-calc(L);
	if (ans<0) ans+=mod;
	printf("%d\n",ans);
}