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

#define int long long  

constexpr int mod = 1e9 + 7;

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

	int n, m, k;
	cin >> n >> m >> k;

	vector<int> a;
	while (m) {
		a.push_back(m % 2);
		m /= 2;
	}

	auto qpow = [&](int x, int y) {
		int res = 1;
		for (; y; y /= 2, x = x * x % mod) {
			if (y % 2) {
				res = res * x % mod;
			}
		}
		return res;
	};

	vector<int> fac(k + 1, 1), inv(k + 1, 1);
	for (int i = 1; i <= k; i++) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = qpow(fac[i], mod - 2);
	}

	int mx = 0;
	for (int i = 0; i <= k; i++) {
		mx = max(mx, i * (k - i));
	}

	auto c = [&](int x, int y) {
		return fac[x] * inv[y] % mod * inv[x - y] % mod; 
	};

	int sz = a.size();
	vector dp(sz, vector(k + 1, map<int, int>()));

	function<int(int, int, int)> dfs = [&](int now, int x, int s) {
		if (now == -1) {
			if (s == 0) {
				return 1LL;
			} else {
				return 0LL;
			}
		}
		if (s < 0) {
			return 0LL;
		}
		if (mx * ((1LL << (now + 1)) - 1) < s) {
			return 0LL;
		}
		if (dp[now][x].count(s)) {
			return dp[now][x][s];
		}
		int ans = 0;
		if (a[now]) {
			for (int i = 0; i <= x; i++) {
				for (int j = 0; j <= k - x; j++) {
					int v = dfs(now - 1, i, s - (1LL << now) * (i + j) * (k - i - j));
					v = v * c(x, i) % mod * c(k - x, j) % mod;
					ans = (ans + v) % mod;
				}
			}
		} else {
			for (int i = 0; i <= k - x; i++) {
				int v = dfs(now - 1, x, s - (1LL << now) * i * (k - i));
				v = v * c(k - x, i) % mod;
				ans = (ans + v) % mod;
			}
		}
		dp[now][x][s] = ans;
		return ans;
	};

	cout << dfs(sz - 1, k, n) << "\n";

    return 0;
}