#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>

const int md = 1000000007;

inline int add(int a, int b) {
	return a + b < md ? a + b : a + b - md;
}
inline int sub(int a, int b) {
	return a - b < 0 ? a - b + md : a - b;
}
inline int mul(int a, int b) {
	return (long long)a * b % md;
}

const int N = 23;
long long k;
int num = 0;
char l[N], r[N];
std::map<long long, int> repr;
std::vector<std::vector<int> > dp;
std::vector<long long> back;

void build(long long k, int i = 2) {
	if (i == 8) return;
	build(k, i + 1);
	while (!(k % i)) {
		k /= i;
		repr[k] = num++;
		back.push_back(k);
		build(k, i + 1);
	}
}

long long f(char *s, bool isr) {
	int len, ans = 0;
	for (len = 1; s[len]; ++len) {
		ans = add(ans, sub(dp[len][0], dp[len - 1][repr[1]]));
	}
	long long kk = k;
	for (int i = 0; i < len; ++i) {
		int dig = s[i] - '0';
		for (int j = 0 + !i; j < dig; ++j) {
			long long g = std::__gcd((long long)j, kk);
			ans = add(ans, dp[len - i - 1][j == 0 ? repr[1] : repr[kk / g]]);
		}
		if (!dig) kk = 1;
		else {
			long long g = std::__gcd((long long)dig, kk);
			kk /= g;
		}
	}
	if (kk == 1 && isr) ans = add(ans, 1);
	return ans;
}

int main() {
	scanf("%lld%s%s", &k, l, r);
	repr[k] = 0;
	back.push_back(k);
	++num;
	build(k);
	if (!repr.count(1)) {
		repr[1] = num++;
		back.push_back(1);
	}
	for (int len = 0; len < N; ++len) {
		dp.push_back(std::vector<int>(back.size()));
		if (len == 0) {
			dp[0][repr[1]] = 1;
			continue;
		}
		for (int i = 0; i < (int)back.size(); ++i) {
			long long val = back[i];
			for (int j = 0; j < 10; ++j) {
				long long g = std::__gcd((long long)j, val);
				dp[len][i] = add(dp[len][i], dp[len - 1][j == 0 ? repr[1] : repr[val / g]]);
			}
		}
	}
	printf("%d\n", sub(f(r, 1), f(l, 0)));
	return 0;
}