#include<bits/stdc++.h>

using namespace std;

#define ll long long

const int mod=1e9+7;

ll K,l,r;
ll f[20][2][2][2];
ll g[20][65][37][25][21][2];
int len;
ll maxx;
int num[33];
ll qwq[33],qwqq[33];
int cnt[5];

ll dfs(int now,int top,int limit,int bj){
	if(now==len+1) return bj;
	if(f[now][top][limit][bj]!=-1) return f[now][top][limit][bj];
	int up=limit?num[len-now+1]:9;
	ll ans=0;
	for(int i=0;i<=up;++i){
		if(top){
			if(i==0) ans=(ans+dfs(now+1,top,limit&(i==up),bj))%mod;
			else ans=(ans+dfs(now+1,0,limit&(i==up),bj))%mod;
		}else{
			ans=(ans+dfs(now+1,0,limit&(i==up),bj|(i==0)))%mod;
		}
	}
	f[now][top][limit][bj]=ans;
	return ans;
}

ll dfs1(int now,int a,int b,int c,int d,int top,int limit){
	if(now==len+1) return (a>=cnt[1]&&b>=cnt[2]&&c>=cnt[3]&&d>=cnt[4]);
	if(!top&&g[now][a][b][c][d][limit]!=-1) return g[now][a][b][c][d][limit];
	int up=limit?num[len-now+1]:9;
	ll ans=0;
	for(int i=top?0:1;i<=up;++i){
		int ii=i;
		int aa=a,bb=b,cc=c,dd=d;
		if(i==0){
			ans=(ans+dfs1(now+1,a,b,c,d,top,limit&(i==up)))%mod;
			continue;
		}
		while(ii%2==0) ii/=2,++aa;
		while(ii%3==0) ii/=3,++bb;
		while(ii%5==0) ii/=5,++cc;
		while(ii%7==0) ii/=7,++dd;
		ans=(ans+dfs1(now+1,aa,bb,cc,dd,0,limit&(i==up)))%mod;
	}
	if(!top) g[now][a][b][c][d][limit]=ans;
	return ans;
}

ll solve(ll x){
	memset(f,-1,sizeof(f));memset(g,-1,sizeof(g));
	ll ans=0;
	maxx=x;
	len=0;
	while(x){
		num[++len]=x%10;
		x/=10;
	}
	ans=(ans+dfs(1,1,1,0))%mod;
	if(K==1) ans=(ans+dfs1(1,0,0,0,0,1,1))%mod;
	return ans;
}

signed main(){
	ios::sync_with_stdio(0);cin.tie(0);
	cin>>K>>l>>r;qwq[0]=1;
	for(int i=1;i<=20;++i){
		qwq[i]=qwq[i-1]*10%mod;
	}
	while(K%2==0){
		K/=2;
		cnt[1]++;
	}
	while(K%3==0){
		K/=3;
		cnt[2]++;
	}
	while(K%5==0){
		K/=5;
		cnt[3]++;
	}
	while(K%7==0){
		K/=7;
		cnt[4]++;
	}
	cout<<(solve(r)-solve(l-1)+mod)%mod<<'\n';
	return 0;
}