#include <bits/stdc++.h>

using namespace std;

const int md = 1000000007;

int pow(int a, int p) {
	int r = 1;
	while (p > 0) {
		if (p % 2 == 1) r = r * 1ll * a % md;
		a = a * 1ll * a % md;
		p /= 2;
	}
	return r;
}

int main() {
	int T;
	ignore = scanf("%d", &T);
	while (T--) {
		int n, k, m;
		ignore = scanf("%d %d %d", &n, &k, &m);
		
		int p = (n - 1ll) * pow(n, md - 2) % md;
		int ans = pow(p, (m + 1) / 2);
		
		if (m % 2 == 0) {
			ans = ans * (n + k - 1ll) % md * pow(n + k, md - 2) % md;
		}
		
		printf("%d\n", (md + 1 - ans) % md);
	}
	
	return 0;
}