#include <bits/stdc++.h>
#define ll long long
#define db double
#define down 0.9972
#define MAXN 100000
#define mid ((l + r) >> 1)
using namespace std;

ll read() {
    ll x = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') {x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar();}
    return x * f;
}

const int mod = 1e9 + 7;

ll f[100][1010][20];

ll n, m, k, c[110][110];

void solve() {
	n = read(); m = read(); k = read();
	c[0][0] = 1;
	for(int i = 1; i <= k; i++)
		for(int j = 0; j <= i; j++) {
			c[i][j] = 1;
			for(int p = 1; p <= j; p++)
				c[i][j] = c[i][j] * (i - p + 1) / p;
		}
	f[0][0][0] = 1;
	for(int i = 1; i <= 60; i++) {
		int bt = (m >> (i - 1)) & 1, pt = (n >> (i - 1) & 1);
		for(int j = 0; j <= 1000; j++) {//有p个大于m
			for(int q = 0; q <= k; q++) {//选q个1
				ll vl = j + q * (k - q);
				if((vl & 1) != pt) continue;
				for(int p = 0; p <= k; p++) {
					if(!f[i - 1][j][p]) continue;
					if(bt) {
						for(int x = max(0ll, q - k + p); x <= min(p, q); x++) {
							f[i][vl / 2][x] += f[i - 1][j][p] * c[p][x] * c[k - p][q - x], f[i][vl / 2][x] %= mod;
							//printf("%d %d %d %lld  -> %d %lld %d %lld\n", i - 1, j, p, f[i - 1][j][p], i, vl / 2, x, f[i][vl / 2][x]);
						}
					}
					else {
						for(int x = max(0ll, q - k + p); x <= min(p, q); x++) {
							f[i][vl / 2][p + (q - x)] += f[i - 1][j][p] * c[p][x] * c[k - p][q - x] % mod, f[i][vl / 2][p + (q - x)] %= mod;
						//printf("%d %d %d %lld  -> %d %lld %d %lld\n", i - 1, j, p, f[i - 1][j][p], i, vl / 2, p + (q - x), f[i][vl / 2][p + (q - x)]);
						}
					}
				}
			}
		}
	}
	printf("%lld\n", f[60][0][0]);
}

int main() {
	solve();
	return 0;
}
/*
 5
 14 5
 7 13 1 6 14 2 16 17 18 19 34 36 20 23

*/