#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
using graph = vector<VI>;
template<class T = ll> using w_graph = vector<vector<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }
template<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }
template<class T>inline void END(T s) { print(s); exit(0); }
void END() { exit(0); }

int main() {
    init();

    VI p;
    const int lim = 72;
    FOR(i, 2, lim) {
        bool isP = true;
        for (int j = 2; j * j <= i; ++j) {
            if (i % j == 0)isP = false;
        }
        if (isP)p.push_back(i);
    }
    int s = p.size();

    ll a, b; cin >> a >> b;
    int n = b - a + 1;
    auto dp = vec<ll>(n + 1, 1 << s);
    dp[0][0] = 1;
    FOR(i, 0, n) {
        ll x = a + i;
        int nxtbit = 0;
        FOR(j, 0, s) {
            if (x % p[j] == 0)nxtbit |= (1 << j);
        }
        FOR(bit, 0, 1 << s) {
            dp[i + 1][bit] += dp[i][bit];
            if(!(bit&nxtbit))dp[i + 1][bit|nxtbit] += dp[i][bit];
        }
    }
    ll ans = 0;
    FOR(bit, 0, 1 << s)ans += dp[n][bit];
    print(ans);

    return 0;
}
#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <queue>
#include <iomanip>
#include <numeric>
#include <cmath>
using namespace std;

int main() {
	string n;
	cin >> n;
	int k;
	cin >> k;
	int nn = n.size();
	vector<vector<long long int>> v(nn + 1, vector<long long int>(k + 1, 0));
	unordered_set<int> us;
	long long int res = 0;
	const int mod = 1e9 + 7;
	for (int i = 1; i <= nn; i++) {
		// v[already checked][how many used]
		if (i > 1) {
			v[i][1] += 15;
		}
		for (int j = 0; j <= k; j++) {
			// v[i - 1][j] -> v[i][j or j + 1];
			v[i][j] += v[i - 1][j] * j;
			if (j > 0) v[i][j] += v[i - 1][j - 1] * (16 - j + 1);
			v[i][j] %= mod;
		}

		char c = n[i - 1];
		int nc = (c <= '9' and c >= '0' ? c - '0' : c - 'A' + 10);
		for (int j = (i == 1 ? 1 : 0); j < nc; j++) {
			int e = 0;
			if (us.count(j) == 0) e = 1;
			if (us.size() + e <= k) {
				v[i][us.size() + e]++;
			}
		}
		us.insert(nc);
	}
	if (us.size() == k) res++;
	for (int i = k; i <= k; i++) {
		res += v[nn][i];
	}
	res %= mod;
	cout << res << endl;
}

