#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MOD = (int) 1e9 + 7;

int add(int a, int b, int m = MOD) {
	return a + b < m ? a + b : a + b - m;
}

int mul(int a, int b, int m = MOD) {
	return a * 1ll * b % m;
}

void addTo(int &a, int b, int m = MOD) {
	a += b;
	
	if (a >= m) {
		a -= m;
	}
}

ll k;
string L, R;

int dp[60][40][30][25][2][2];
int new_dp[60][40][30][25][2][2];
int req[4];
int memo[10][4];

int calc(string s, bool count_less) {
	while (s.size() < 25) {
		s = "0" + s;
	}
	
	for (int a = 0; a <= req[0]; a++) {
		for (int b = 0; b <= req[1]; b++) {
			for (int c = 0; c <= req[2]; c++) {
				for (int d = 0; d <= req[3]; d++) {
					for (int le = 0; le < 2; le++) {
						for (int z = 0; z < 2; z++) {
							dp[a][b][c][d][le][z] = 0;
							new_dp[a][b][c][d][le][z] = 0;
						}
					}
				}
			}
		}
	}
	
	dp[0][0][0][0][0][1] = 1;
	
	for (int i = 0; i < s.size(); i++) {
		int cur_digit = s[i] - '0';
		
		for (int a = 0; a <= req[0]; a++) {
			for (int b = 0; b <= req[1]; b++) {
				for (int c = 0; c <= req[2]; c++) {
					for (int d = 0; d <= req[3]; d++) {
						for (int le = 0; le < 2; le++) {
							for (int z = 0; z < 2; z++) {
								int me = dp[a][b][c][d][le][z];
								
								if (!me) {
									continue;
								}
								
								for (int x = 0; x <= 9; x++) {				
									if (le == 0 && x > cur_digit) {
										continue;
									}
									
									int new_le = le || (x < cur_digit);
									int new_a = x == 0 ? (z == 1 ? 0 : req[0]) : (k > 1 ? a : min(req[0], a + memo[x][0]));
									int new_b = x == 0 ? (z == 1 ? 0 : req[1]) : (k > 1 ? b : min(req[1], b + memo[x][1]));
									int new_c = x == 0 ? (z == 1 ? 0 : req[2]) : (k > 1 ? c : min(req[2], c + memo[x][2]));
									int new_d = x == 0 ? (z == 1 ? 0 : req[3]) : (k > 1 ? d : min(req[3], d + memo[x][3]));
									int new_z = z && (x == 0);
									
									addTo(new_dp[new_a][new_b][new_c][new_d][new_le][new_z], me);
								}
							}
						}
					}
				}
			}
		}
		
		for (int a = 0; a <= req[0]; a++) {
			for (int b = 0; b <= req[1]; b++) {
				for (int c = 0; c <= req[2]; c++) {
					for (int d = 0; d <= req[3]; d++) {
						for (int le = 0; le < 2; le++) {
							for (int z = 0; z < 2; z++) {
								dp[a][b][c][d][le][z] = new_dp[a][b][c][d][le][z];
								new_dp[a][b][c][d][le][z] = 0;
							}
						}
					}
				}
			}
		}
	}
	
	int ans = 0;
	
	for (int le = (count_less ? 1 : 0); le < 2; le++) {
		addTo(ans, dp[req[0]][req[1]][req[2]][req[3]][le][0]);
	}
	
	return ans;
}

int main() {	
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	cin >> k >> L >> R;
	
	int tmp = 0;
	
	for (int p: {2, 3, 5, 7}) {
		int cnt = 0;
		
		while (k % p == 0) {
			k /= p;
			cnt++;
		}
		
		req[tmp++] = cnt;
	}
	
	for (int i = 1; i <= 9; i++) {
		int v = i, p = 0;
		
		for (int k: {2, 3, 5, 7}) {
			int cnt = 0;
			
			while (v % k == 0) {
				cnt++;
				v /= k;
			}
			
			memo[i][p++] = cnt;
		}
	}
	
	if (k > 1) {
		req[0] = req[1] = req[2] = req[3] = 1;
	}
	
	int ans = calc(R, false);
	ans = add(ans, MOD - calc(L, true));
	cout << ans << '\n';
	return 0;
}