//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

#define X first
#define Y second

const ll mod = 1000000007;
//const ll mod = 998244353;


vector<ll> pr = {2,3,5,7};
ll dp[2][59][37][25][21];
ll val[10][4];
vector<ll> mx(4);

vector<ll> a(4);

void fill(int p)
{
    if (p==pr.size())
    {
        dp[0][a[0]][a[1]][a[2]][a[3]] = 0;
        dp[1][a[0]][a[1]][a[2]][a[3]] = 0;
        return;
    }
    for (int i=0;i<=mx[p];i++)
    {
        a[p] = i;
        fill(p+1);
    }
}

void out(int p)
{
    if (p==pr.size())
    {
        cout << a[0] << " " << a[1] << " " << a[2] << " " << a[3] << " ";
        cout << dp[0][a[0]][a[1]][a[2]][a[3]] << " ";
        cout << dp[1][a[0]][a[1]][a[2]][a[3]] << endl;
        return;
    }
    for (int i=0;i<=mx[p];i++)
    {
        a[p] = i;
        out(p+1);
    }
}

int D = -1, pos = -1;
ll ans = 0;

void upd(int p)
{
    if (p==pr.size())
    {
        if (pos!=0)
        {
            for (int d=1;d<=9;d++)
            {
                int ok = 1;
                for (int j=0;j<4;j++)
                {
                    if (a[j]>val[d][j]) ok = 0;
                }
                if (ok==0) continue;
                ans = (ans+dp[0][a[0]][a[1]][a[2]][a[3]])%mod;
                ans = (ans+dp[1][a[0]][a[1]][a[2]][a[3]])%mod;
            }
        }
        else
        {
            for (int d=1;d<D;d++)
            {
                int ok = 1;
                for (int j=0;j<4;j++)
                {
                    if (a[j]>val[d][j]) ok = 0;
                }
                if (ok==0) continue;
                ans = (ans+dp[0][a[0]][a[1]][a[2]][a[3]])%mod;
                ans = (ans+dp[1][a[0]][a[1]][a[2]][a[3]])%mod;
            }
            {
                int d = D;
                int ok = 1;
                for (int j=0;j<4;j++)
                {
                    if (a[j]>val[d][j]) ok = 0;
                }
                if (ok!=0)
                {
                    ans = (ans+dp[0][a[0]][a[1]][a[2]][a[3]])%mod;
                }
            }
        }
        ll x0 = dp[0][a[0]][a[1]][a[2]][a[3]];
        ll x1 = dp[1][a[0]][a[1]][a[2]][a[3]];
        dp[0][a[0]][a[1]][a[2]][a[3]] = 0;
        dp[1][a[0]][a[1]][a[2]][a[3]] = 0;
        for (int d=0;d<=9;d++)
        {
            vector<ll> b(4);
            for (int j=0;j<4;j++)
            {
                b[j] = max(0LL,(a[j]-val[d][j]));
            }
            if (d<D)
            {
                dp[0][b[0]][b[1]][b[2]][b[3]] = (dp[0][b[0]][b[1]][b[2]][b[3]]+x0+x1)%mod;
            }
            if (d==D)
            {
                dp[0][b[0]][b[1]][b[2]][b[3]] = (dp[0][b[0]][b[1]][b[2]][b[3]]+x0)%mod;
                dp[1][b[0]][b[1]][b[2]][b[3]] = (dp[1][b[0]][b[1]][b[2]][b[3]]+x1)%mod;
            }
            if (d>D)
            {
                dp[1][b[0]][b[1]][b[2]][b[3]] = (dp[1][b[0]][b[1]][b[2]][b[3]]+x0+x1)%mod;
            }
        }
        return;
    }
    for (int i=0;i<=mx[p];i++)
    {
        a[p] = i;
        upd(p+1);
    }
}

ll calc(string s)
{
    ans = 0;
    fill(0);
    dp[0][a[0]][a[1]][a[2]][a[3]] = 1;
    for (ll i=s.length()-1;i>=0;i--)
    {
        D = s[i]-'0', pos = i;
        upd(0);
        //cout << "!!! " << i << endl;
        //out(0);
    }
    return ans;
}

void solve()
{
    ll k;
    string s, t;
    cin >> k >> s >> t;
    for (ll i=0;i<pr.size();i++)
    {
        while (k%pr[i]==0) mx[i]++, k /= pr[i];
    }
    for (ll x=0;x<=9;x++)
    {
        if (x==0)
        {
            for (ll i=0;i<pr.size();i++)
            {
                val[x][i] = mx[i];
            }
            continue;
        }
        ll y = x;
        for (ll i=0;i<pr.size();i++)
        {
            val[x][i] = 0;
            while (y%pr[i]==0) val[x][i]++, y /= pr[i];
        }
    }
    if (k!=1)
    {
        cout << 0 << "\n";
        return;
    }
    ll A = (mod+calc(t)-calc(s))%mod;
    for (ll i=0;i<s.length();i++)
    {
        ll d = s[i]-'0';
        for (ll j=0;j<4;j++)
        {
            mx[j] -= val[d][j];
        }
    }
    ll ok = 1;
    for (ll i=0;i<4;i++) if (mx[i]>0) ok = 0;
    A = (A+ok)%mod;
    cout << A << "\n";

}


int main()
{
    ios_base::sync_with_stdio(false);
    ll T;
    T = 1;
    //cin >> T;
    while (T--) solve();
}