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

typedef long long ll;
const ll mod=1'000'000'007;

__int128 read(){
	string str;
	cin >> str;
	__int128 ret=0;
	for (auto ch:str) ret=ret*10+(ch-'0');
	return ret;
}
void add(ll &A,ll B){A+=B;if (A>=mod) A-=mod;}
void sub(ll &A,ll B){A-=B;if (A<0) A+=mod;}

vector<ll> digit;
map<pair<ll,ll>,ll> dict;

ll dfs(ll dep,bool lead,bool lt,ll K){

//	cerr << "-------dfs()-------" << endl;
//	cerr << dep << " " << lead << " " << lt << " " << K << endl;

	if (dep==-1){
		if (K==1) return 1;
		return 0;
	}
	pair<ll,ll> PAIR=make_pair(dep,K);
	if (lead && lt && dict.count(PAIR)) return dict[PAIR];
	
	ll mx=(lt)?(9):(digit[dep]);
	
//	cerr << "mx : " << mx << endl;
	
	ll ans=0;
	for (ll i=0;i<=mx;i++){
		bool nxtlead=lead|(i!=0);
		bool nxtlt=lt|(i<digit[dep]);
		ll nxtK=K;
		if (nxtlead){
			ll g=__gcd(K,i);
			nxtK=K/g;
		}
		add(ans,dfs(dep-1,nxtlead,nxtlt,nxtK));
	}
	if (lead && lt) dict[PAIR]=ans;
//	cerr << "-----res---------" << endl;
//	cerr << dep << " " << lead << " " << lt << " " << K << endl;
//	cerr << "ans : " << ans << endl;
	
	return ans;
}

ll gao(__int128 x,ll K){
	if (x==0) return 0;
	digit.clear();
	for (;x;x/=10) digit.emplace_back(x%10);
	return dfs((int)digit.size()-1,0,0,K);
}

bool test(ll K){
	for (;K%2==0;) K/=2;
	for (;K%3==0;) K/=3;
	for (;K%5==0;) K/=5;
	for (;K%7==0;) K/=7;
	return (K==1);
}

int main(){
	ios_base::sync_with_stdio(false);
	long long K=1e17;
	cin >> K;
//	__int128 L=1;
//	__int128 R=1e20;
	
	__int128 L=read();
	__int128 R=read();
	
	if (!test(K)) cout << 0 << "\n";
	
	ll ans=gao(R,K);
	sub(ans,gao(L-1,K)); 
	cout << ans << "\n";
	return 0;
}