#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
istream& operator >> (istream& in, __int128& num) {
    string s;in>>s;
    num=0;
    for(auto it:s)num=num*10+it-'0';
    return in;
}

ostream& operator << (ostream& out, __int128 num) {
    string s;
    do{
        s.push_back(char(num%10+'0'));
        num/=10;
    }while(num>0);
    reverse(s.begin(),s.end());
    out<<s;
    return out;
}
typedef __int128 ll;
void add(int &x,int y){
    if((x+=y)>=mod)x-=mod;
}
void del(int &x,int y){
    if((x-=y)<0)x+=mod;
}
int dp[2][22][80][50][31][31];
int p[25];
void f1(int &a,int &b,int &c,int &d,int x){
    // a=2 b=3 c=5 d=7
    if(x==2)a--;
    if(x==3)b--;
    if(x==4)a-=2;
    if(x==5)c--;
    if(x==6)a--,b--;
    if(x==7)d--;
    if(x==8)a-=3;
    if(x==9)b-=2;
}
void f2(int &a,int &b,int &c,int &d,int x){
    // a=2 b=3 c=5 d=7
    if(x==2)a++;
    if(x==3)b++;
    if(x==4)a+=2;
    if(x==5)c++;
    if(x==6)a++,b++;
    if(x==7)d++;
    if(x==8)a+=3;
    if(x==9)b+=2;
}
int dfs(int flag,int i,int a,int b,int c,int d){
    // if(a<0||b<0||c<0||d<0)return 0;
    if(a<0)a=0;
    if(b<0)b=0;
    if(c<0)c=0;
    if(d<0)d=0;
    if(i==0){
        return (a+b+c+d)!=0;
    }
    if(dp[flag][i][a][b][c][d]!=-1)return dp[flag][i][a][b][c][d];
    int g=9;
    if(flag)g=p[i];
    int res=0;
    for(int x=1;x<=g;x++){
        f1(a,b,c,d,x);
        add(res,dfs(flag&(x==g),i-1,a,b,c,d));
        f2(a,b,c,d,x);
    }
    // cout<<"flag="<<flag<<" i="<<i<<" a="<<a<<" b="<<b<<" c="<<c<<" d="<<d<<" res="<<res<<"\n";
    return dp[flag][i][a][b][c][d]=res;
}
int solve(ll n,int a,int b,int c,int d)
{
    if(n==0)return 0;
    // cout<<"n="<<n<<"\n";
    memset(dp,-1,sizeof(dp));
    int t=0;
    while(n>0){
        t++;
        p[t]=n%10;
        n/=10;
    }
    // cout<<"t="<<t<<"\n";
    int res=0;
    for(int i=t-1;i>=1;i--)add(res,dfs(0,i,a,b,c,d));
    add(res,dfs(1,t,a,b,c,d));
    return res;
}
int dp2[2][2][2][25];
int p2[25];
int dfs2(int flag,int ok,int fir,int i){
    if(i==0){
        if(ok&&!fir)return 1;
        return 0;
    }
    // cout<<"flag="<<flag<<" ok="<<ok<<" fir="<<fir<<" i="<<i<<"\n";
    if(dp2[flag][ok][fir][i]!=-1)return dp2[flag][ok][fir][i];
    int g=9;
    if(flag)g=p[i];
    int res=0;
    for(int x=fir;x<=g;x++){
        add(res,dfs2(flag&(x==g),ok|(x==0),0,i-1));
    }
    return dp2[flag][ok][fir][i]=res;
}
int solve2(ll n){
    if(n==0)return 0;
    // cout<<"n="<<n<<"\n";
    memset(dp2,-1,sizeof(dp2));
    int t=0;
    while(n>0){
        t++;
        p[t]=n%10;
        n/=10;
    }
    // cout<<"t="<<t<<endl;
    int res=0;
    for(int i=t-1;i>=1;i--)add(res,dfs2(0,0,1,i));
    add(res,dfs2(1,0,1,t));
    return res;
}
int main()
{   
    long long k;
    ll L,R;
    cin>>k>>L>>R;
    vector<int> cnt;
    for(auto x:{2,3,5,7}){
        int g=0;
        while(k%x==0)k/=x,g++;
        cnt.push_back(g);
    }
    if(k!=1){
        int ans=solve2(R);
        del(ans,solve2(L-1));
        cout<<ans<<"\n";
        return 0;
    }
    int ans=(R-L+1)%mod;
    del(ans,solve(R,cnt[0],cnt[1],cnt[2],cnt[3]));
    add(ans,solve(L-1,cnt[0],cnt[1],cnt[2],cnt[3]));
    cout<<ans<<"\n";
    return 0;
}