#include<bits/stdc++.h>
using namespace std;

#define int long long

const int P=1e9+7;

int f[22][2][2][22][22][22][23];

string l,r;

int k;

__int128 pw[11][21];

int dp(int x,int lead,int dw,int up,int c2,int c3,int c5,int c7)
{
    if(x==r.size())
    {
        if(c7==22)
            return 1;
        __int128 w=pw[2][c2]%k*pw[3][c3]%k*pw[5][c5]%k*pw[7][c7]%k;
        return !w;
    }
    if(f[x][lead][up][c2][c3][c5][c7]!=-1)
        return f[x][lead][up][c2][c3][c5][c7];
    int &ret=f[x][lead][up][c2][c3][c5][c7];
    ret=0;
    for(int i=(dw?l[x]-'0':0);i<=(up?r[x]-'0':9);i++)
    {
        int w=i;
        int nlead=lead&&i==0;
        int ndw=dw&&i==l[x]-'0';
        int nup=up&&i==r[x]-'0';
        int nc2=c2,nc3=c3,nc5=c5,nc7=c7;
        if(!nlead)
        {
            if(!w||nc7==22)
                nc2=nc3=nc5=nc7=22;
            else
            {
                while(w%2==0)
                    nc2++,w/=2;
                while(w%3==0)
                    nc3++,w/=3;
                while(w%5==0)
                    nc5++,w/=5;
                while(w%7==0)
                    nc7++,w/=7;
            }
        }
        ret+=dp(x+1,nlead,ndw,nup,nc2,nc3,nc5,nc7);
    }
    return ret%=P;
}

signed main()
{
    cin>>k>>l>>r;
    while(l.size()<r.size())
        l='0'+l;
    for(int i=1;i<=9;i++)
    {
        pw[i][0]=1;
        for(int j=1;j<=20;j++)
            pw[i][j]=pw[i][j-1]*i;
    }
    memset(f,-1,sizeof(f));
    cout<<dp(0,1,1,1,0,0,0,0)<<"\n";
}