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

#define int long long

const int P=1e9+7;

map<int,int> f[22][2][2][2];

string l,r;

int k;

int dp(int x,int lead,int dw,int up,int w)
{
    if(x==r.size())
        return !w;
    if(f[x][lead][dw][up].count(w))
        return f[x][lead][dw][up][w];
    int &ret=f[x][lead][dw][up][w];
    for(int i=(dw?l[x]-'0':0);i<=(up?r[x]-'0':9);i++)
    {
        int nlead=lead&&i==0;
        int ndw=dw&&i==l[x]-'0';
        int nup=up&&i==r[x]-'0';
        int nw=w;
        if(!nlead)
            nw=(__int128)nw*i%k;
        ret+=dp(x+1,nlead,ndw,nup,nw);
    }
    return ret%=P;
}

signed main()
{
    cin>>k>>l>>r;
    while(l.size()<r.size())
        l='0'+l;
    cout<<dp(0,1,1,1,1%k)<<"\n";
}