#include <iostream>
#include <vector>
#include <map>
#include <numeric>
using namespace std;
using ll = long long;
const ll mod = 1e9+7;

void fix(ll &i) {
	i %= mod;
	if (i < 0) i += mod;
	i %= mod;
}

ll count(ll k, string up) {
	map<ll, ll> hi, lo;
	for (int i = 1; i < up[0]-'0'; i++) {
		lo[gcd(i, k)%k] += 1;
	}
	hi[gcd(up[0]-'0', k)%k] += 1;
	for (int i = 1; i < up.size(); i++) {
		map<ll, ll> nhi, nlo;
		for (int j = 0; j <= 9; j++) {
			for (auto [g, cnt] : hi) {
				if (j == up[i]-'0') {
					fix(nhi[gcd(g*j, k)%k] += cnt);
				}
				else if (j < up[i] -'0') {
					fix(nlo[gcd(g*j, k)%k] += cnt);
				}
			}

			for (auto [g, cnt] : lo) {
				fix(nlo[gcd(g*j, k)%k] += cnt);
			}
		}
		hi = nhi;
		lo = nlo;
	}
	return (hi[0] + lo[0])%mod;
}

ll countAll(ll k, string r) {
	ll out = count(k, r);
	string s = "9";
	while (s.size() < r.size()) {
		fix(out += count(k, s));
		s.push_back('9');
	}
	return out;
}

int main() {
	ll k; cin >> k;
	string l, r; cin >> l >> r;
	ll out = countAll(k, r);
	if (l != "1") {
		int i = l.size()-1;
		while (l[i] == '0') {
			l[i] = '9';
			i--;
		}
		l[i]--;
		if (l[0] == '0') l.erase(l.begin(), l.begin()+1);
		fix(out -= countAll(k, l));
	}
	cout << out << endl;
}