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

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

template<class data_t, data_t _mod>
struct modular_fixed_base{
#define IS_INTEGRAL(T) (is_integral_v<T> || is_same_v<T, __int128_t> || is_same_v<T, __uint128_t>)
#define IS_UNSIGNED(T) (is_unsigned_v<T> || is_same_v<T, __uint128_t>)
	static_assert(IS_UNSIGNED(data_t));
	static_assert(_mod >= 1);
	static constexpr bool VARIATE_MOD_FLAG = false;
	static constexpr data_t mod(){
		return _mod;
	}
	template<class T>
	static vector<modular_fixed_base> precalc_power(T base, int SZ){
		vector<modular_fixed_base> res(SZ + 1, 1);
		for(auto i = 1; i <= SZ; ++ i) res[i] = res[i - 1] * base;
		return res;
	}	
	static vector<modular_fixed_base> _INV;
	static void precalc_inverse(int SZ){
		if(_INV.empty()) _INV.assign(2, 1);
		for(auto x = _INV.size(); x <= SZ; ++ x) _INV.push_back(_mod / x * -_INV[_mod % x]);
	}
	// _mod must be a prime
	static modular_fixed_base _primitive_root;
	static modular_fixed_base primitive_root(){
		if(_primitive_root) return _primitive_root;
		if(_mod == 2) return _primitive_root = 1;
		if(_mod == 998244353) return _primitive_root = 3;
		data_t divs[20] = {};
		divs[0] = 2;
		int cnt = 1;
		data_t x = (_mod - 1) / 2;
		while(x % 2 == 0) x /= 2;
		for(auto i = 3; 1LL * i * i <= x; i += 2){
			if(x % i == 0){
				divs[cnt ++] = i;
				while(x % i == 0) x /= i;
			}
		}
		if(x > 1) divs[cnt ++] = x;
		for(auto g = 2; ; ++ g){
			bool ok = true;
			for(auto i = 0; i < cnt; ++ i){
				if((modular_fixed_base(g).power((_mod - 1) / divs[i])) == 1){
					ok = false;
					break;
				}
			}
			if(ok) return _primitive_root = g;
		}
	}
	constexpr modular_fixed_base(){ }
	modular_fixed_base(const double &x){ data = _normalize(llround(x)); }
	modular_fixed_base(const long double &x){ data = _normalize(llround(x)); }
	template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr> modular_fixed_base(const T &x){ data = _normalize(x); }
	template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr> static data_t _normalize(const T &x){
		int sign = x >= 0 ? 1 : -1;
		data_t v =  _mod <= sign * x ? sign * x % _mod : sign * x;
		if(sign == -1 && v) v = _mod - v;
		return v;
	}
	template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr> operator T() const{ return data; }
	modular_fixed_base &operator+=(const modular_fixed_base &otr){ if((data += otr.data) >= _mod) data -= _mod; return *this; }
	modular_fixed_base &operator-=(const modular_fixed_base &otr){ if((data += _mod - otr.data) >= _mod) data -= _mod; return *this; }
	template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr> modular_fixed_base &operator+=(const T &otr){ return *this += modular_fixed_base(otr); }
	template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr> modular_fixed_base &operator-=(const T &otr){ return *this -= modular_fixed_base(otr); }
	modular_fixed_base &operator++(){ return *this += 1; }
	modular_fixed_base &operator--(){ return *this += _mod - 1; }
	modular_fixed_base operator++(int){ modular_fixed_base result(*this); *this += 1; return result; }
	modular_fixed_base operator--(int){ modular_fixed_base result(*this); *this += _mod - 1; return result; }
	modular_fixed_base operator-() const{ return modular_fixed_base(_mod - data); }
	modular_fixed_base &operator*=(const modular_fixed_base &rhs){
		if constexpr(is_same_v<data_t, unsigned int>) data = (unsigned long long)data * rhs.data % _mod;
		else if constexpr(is_same_v<data_t, unsigned long long>){
			long long res = data * rhs.data - _mod * (unsigned long long)(1.L / _mod * data * rhs.data);
			data = res + _mod * (res < 0) - _mod * (res >= (long long)_mod);
		}
		else data = _normalize(data * rhs.data);
		return *this;
	}
	template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr>
	modular_fixed_base &inplace_power(T e){
		if(e == 0) return *this = 1;
		if(data == 0) return *this = {};
		if(data == 1) return *this;
		if(data == mod() - 1) return e % 2 ? *this : *this = -*this;
		if(e < 0) *this = 1 / *this, e = -e;
		modular_fixed_base res = 1;
		for(; e; *this *= *this, e >>= 1) if(e & 1) res *= *this;
		return *this = res;
	}
	template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr>
	modular_fixed_base power(T e) const{
		return modular_fixed_base(*this).inplace_power(e);
	}
	modular_fixed_base &operator/=(const modular_fixed_base &otr){
		make_signed_t<data_t> a = otr.data, m = _mod, u = 0, v = 1;
		if(a < _INV.size()) return *this *= _INV[a];
		while(a){
			make_signed_t<data_t> t = m / a;
			m -= t * a; swap(a, m);
			u -= t * v; swap(u, v);
		}
		assert(m == 1);
		return *this *= u;
	}
#define ARITHMETIC_OP(op, apply_op)\
modular_fixed_base operator op(const modular_fixed_base &x) const{ return modular_fixed_base(*this) apply_op x; }\
template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr>\
modular_fixed_base operator op(const T &x) const{ return modular_fixed_base(*this) apply_op modular_fixed_base(x); }\
template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr>\
friend modular_fixed_base operator op(const T &x, const modular_fixed_base &y){ return modular_fixed_base(x) apply_op y; }
	ARITHMETIC_OP(+, +=) ARITHMETIC_OP(-, -=) ARITHMETIC_OP(*, *=) ARITHMETIC_OP(/, /=)
#undef ARITHMETIC_OP
#define COMPARE_OP(op)\
bool operator op(const modular_fixed_base &x) const{ return data op x.data; }\
template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr>\
bool operator op(const T &x) const{ return data op modular_fixed_base(x).data; }\
template<class T, typename enable_if<IS_INTEGRAL(T)>::type* = nullptr>\
friend bool operator op(const T &x, const modular_fixed_base &y){ return modular_fixed_base(x).data op y.data; }
	COMPARE_OP(==) COMPARE_OP(!=) COMPARE_OP(<) COMPARE_OP(<=) COMPARE_OP(>) COMPARE_OP(>=)
#undef COMPARE_OP
	friend istream &operator>>(istream &in, modular_fixed_base &number){
		long long x;
		in >> x;
		number.data = modular_fixed_base::_normalize(x);
		return in;
	}
//#define _SHOW_FRACTION
	friend ostream &operator<<(ostream &out, const modular_fixed_base &number){
		out << number.data;
	#if defined(LOCAL) && defined(_SHOW_FRACTION)
		cerr << "(";
		for(auto d = 1; ; ++ d){
			if((number * d).data <= 1000000){
				cerr << (number * d).data;
				if(d != 1) cerr << "/" << d;
				break;
			}
			else if((-number * d).data <= 1000000){
				cerr << "-" << (-number * d).data;
				if(d != 1) cerr << "/" << d;
				break;
			}
		}
		cerr << ")";
	#endif
		return out;
	}
	data_t data = 0;
#undef _SHOW_FRACTION
#undef IS_INTEGRAL
#undef IS_SIGNED
};
template<class data_t, data_t _mod> vector<modular_fixed_base<data_t, _mod>> modular_fixed_base<data_t, _mod>::_INV;
template<class data_t, data_t _mod> modular_fixed_base<data_t, _mod> modular_fixed_base<data_t, _mod>::_primitive_root;

// const unsigned int mod = (119 << 23) + 1; // 998244353
const unsigned int mod = 1e9 + 7; // 1000000007
// const unsigned int mod = 1e9 + 9; // 1000000009
// const unsigned long long mod = (unsigned long long)1e18 + 9;
using modular = modular_fixed_base<decay_t<decltype(mod)>, mod>;

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	if (fopen("KEK.inp", "r")){
		freopen("KEK.inp", "r", stdin);
		freopen("KEK.out", "w", stdout);
	}
	
	ll k;
	string l, r;
	cin >> k >> l >> r;

	int m = -1;
	vector <ll> vdivisor;
	vector <array <int, 10>> transition;

	auto prepare_divisor = [&](){
		ll tk = k;
		vector <pair <int, int>> vpf;
		for (auto p: vector <int>{{2, 3, 5, 7}}){
			int q = 0;
			while (tk % p == 0){
				tk /= p;
				q++;
			}
			vpf.emplace_back(p, q);
		}
		if (tk != 1){
			m = 2;
			transition.resize(2);
			transition[0].fill(0);
			transition[1].fill(1);
			transition[0][0] = 1;
			return;
		}

		auto backtrack = [&](auto self, int i, ll cur = 1){
			if (i == ssize(vpf)){
				vdivisor.emplace_back(cur);
				return;
			}
			self(self, i + 1, cur);
			for (int j = 0; j < vpf[i].second; j++){
				cur *= vpf[i].first;
				self(self, i + 1, cur);
			}
		};
		backtrack(backtrack, 0);

		m = ssize(vdivisor);
		sort(vdivisor.begin(), vdivisor.end());
		transition.resize(m);
		for (int i = 0; i < m; i++){
			ll val = vdivisor[i];

			vector <pair <int, int>> vpf_val;
			{
				ll tval = val;
				for (auto p: vector <int>{{2, 3, 5, 7}}){
					int q = 0;
					while (tval % p == 0){
						tval /= p;
						q++;
					}
					vpf_val.emplace_back(p, q);
				}
			}
			transition[i][0] = m - 1;
			for (int d = 1; d <= 9; d++){
				ll tval = val;
				int td = d;
				for (int idx = 0; idx < ssize(vpf); idx++){
					int p = vpf[idx].first, q = vpf[idx].second - vpf_val[idx].second;
					while (td % p == 0 and q > 0){
						tval *= p;
						td /= p;
						q--;
					}
				}
				int j = lower_bound(begin(vdivisor), end(vdivisor), tval) - begin(vdivisor);
				transition[i][d] = j;
			}
		}
	};
	prepare_divisor();

	int n = -1;
	{
		reverse(begin(l), end(l));
		reverse(begin(r), end(r));
		while (ssize(l) < ssize(r)){
			l += '0';
		}
		while (ssize(r) < ssize(l)){
			r += '0';
		}
		n = ssize(l);
	}

	vector <vector <vector <vector <vector <modular>>>>> dp(n + 1, vector <vector <vector <vector <modular>>>>(2, vector <vector <vector <modular>>>(2, vector <vector <modular>>(2, vector <modular>(m, modular(0))))));

	for (int touch_l = 0; touch_l <= 1; touch_l++){
		for (int touch_r = 0; touch_r <= 1; touch_r++){
			dp[0][1][touch_l][touch_r][m - 1] = modular(1);
		}
	}
	for (int d = 1; d <= n; d++){
		for (int started = 0; started <= 1; started++){
			for (int touch_l = 0; touch_l <= 1; touch_l++){
				for (int touch_r = 0; touch_r <= 1; touch_r++){
					int ldig = touch_l ? int(l[d - 1] - '0') : 0;
					int rdig = touch_r ? int(r[d - 1] - '0') : 9;
					for (int i = 0; i < m; i++){
						for (int dig = ldig; dig <= rdig; dig++){
							dp[d][started][touch_l][touch_r][i] += dp[d - 1][started | (dig != 0)][touch_l & (dig == ldig)][touch_r & (dig == rdig)][(started | (dig != 0)) ? transition[i][dig] : 0];
						}
					}
				}
			}
		}
	}

	modular ans = dp[n][0][1][1][0];
	cout << ans << "\n";
}