#include<bits/stdc++.h>
#define Yukinoshita namespace
#define Yukino std
#define int __int128
using Yukinoshita Yukino;
int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?-1:1,ch=getchar();
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int mod=1e9+7;
inline void getmod(int &x)
{
	x-=(x>=mod)*mod;
}
void write(int x)
{
	if(x>9) write(x/10);
	putchar(x%10+'0');
}
int k;
const int p[]={2,3,5,7};
int cnt[4];
int w[50];
using ull=unsigned long long;
const ull up=23333333333333;
int cc[10][4];
unordered_map<ull,int> mp;
int dfs(int d,bool fl,int cnt4[],bool qd,bool ze)
{
	if(!d)
	{
//		cout<<ze<<endl;
		if(ze) return 1;
		if(k>1) return 0;
		for(int i=0;i<4;i++)
			if(cnt4[i]<cnt[i])
				return 0;
		return 1;
	}
	ull hs=d*up*up+fl*up+qd;
	int sum=0,i;
	for(i=0;i<4;i++)
		hs=hs*up+cnt4[i];
	hs=hs*up+ze;
	if(mp.count(hs)) return mp[hs];
	for(i=0;i<10;i++)
		if(fl||i<=w[d])
		{
			int tp[4],j;
			for(j=0;j<4;j++)
				tp[j]=min(cnt[j],cnt4[j]+cc[i][j]);
			getmod(sum+=dfs(d-1,fl||(i<w[d]),tp,qd||i,ze||(!i&&qd)));
		}
	return mp[hs]=sum;
}
int ask(int n)
{
	mp.clear();
	int cnt[4]={0},i,qd=0,tp[4]={0};
	for(;n;n/=10)
		w[++qd]=n%10;
	return dfs(qd,0,tp,0,0);
}
signed main()
{
	k=read();
	int l=read(),r=read(),i,j;
	for(i=0;i<4;i++)
		while(k%p[i]==0)
			cnt[i]++,k/=p[i];
	cc[2][0]=1;
	cc[3][1]=1;
	cc[4][0]=2;
	cc[5][2]=1;
	cc[6][0]=cc[6][1]=1;
	cc[7][3]=1;
	cc[8][0]=3;
	cc[9][1]=2;
	write((ask(r)-ask(l-1)+mod)%mod);
}