#include <bits/stdc++.h>

using namespace std;

#define int long long

const int M = 1e9 + 7;

int mypw(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) (res *= x) %= M;
    (x *= x) %= M;
    y >>= 1;
  }
  return res;
}

int mul(int x, int y) {
  return (x * y) % M;
}

void solve() {
  int n, k, l; cin >> n >> k >> l;
  if (l == 0 || l == 1) { 
    cout << "0\n";
    return;
  }
  if (l == 2) {
    if (n & 1) cout << "0\n";
    else cout << mypw((mypw(l - 1, 2) - 1 + M) % M, (n - 1) * k) << "\n";
    return;
  }
  if (k & 1) cout << mul(mypw((mypw(l - 1, 2) - 1 + M) % M, (n - 1) * k), (mypw(l - 1, k) - (l - 1) * (l - 2) % M + M) % M) << "\n";
  else cout << mul(mypw((mypw(l - 1, 2) - 1 + M) % M, (n - 1) * k), (mypw(l - 1, k) + (l - 1) * (l - 2) % M) % M) << "\n";
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T = 1;
  cin >> T;
  while (T--) solve();
}