题意就是n个格子排成一行,我们有m种颜色,可以给这些格子涂色,保证相邻的格子的颜色不同问,最后恰好使用了k种颜色的方案数。
先从m种里选k种 就是 c m k 对于k种颜色 他的方案数是c k k , k种颜色选k种, 对于第一个坑,因为有k种颜色选 所以有k种选择 第二个坑 有k-1种选择 因为不能跟第一个坑 一样 第三个坑依然是k-1种选择 所以后面的都是k-1种选择
那么对于k种颜色 得到的就是 (c k k) * k* (k-1)^(n-1)
对于k-1种颜色 就是 c k k-1 *(k-1) *(k-2)^(n-1)
把1-k-1的颜色减去 剩下的就是只选k种的(容斥)
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;
#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef pair<long long int,long long int> ii;
typedef long long LL;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e6+10;
const int maxx=600005;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}
inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}
void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;
LL C[maxn];
LL inv[maxn];
int _pow(LL a,LL n)
{
LL ret=1;
while(n)
{
if(n&1) ret=ret*a%mod;
a=a*a%mod;
n>>=1;
}
return ret;
}
void init()
{
inv[1] = 1;
for(int i=2; i<=maxn; i++) inv[i]=(mod-mod/i)*inv[mod%i]%mod;
}
int T;
int main()
{
init();
LL n, m, k;
s_1(T);
W(T--)
{
scanf("%lld%lld%lld", &n,&m,&k);
LL ans = 1;
C[0] = 1;
for(int i=1; i<=k; i++) C[i]=(C[i-1]%mod*(k-i+1))%mod*inv[i]%mod;
for(LL i=k; i>=1; i--)
ans = ((ans*(m-i+1))%mod*inv[i]%mod)%mod;
LL ans2 = 0;
for(LL i=0; i<k; i++)
ans2 = (ans2 + (C[k-i]%mod*(k-i)%mod)*(_pow(k-i-1,n-1)*(i%2==0?1:-1))%mod)%mod;
ans = ((ans%mod*ans2%mod)%mod+mod)%mod;
print(ans);
}
return 0;
}