for (int i = 1; i <= k; ++ i)
{
	int g[2][2];
	g[1][1] = f[1][0] * (m - 1) + f[0][1] * (n - 1);
	g[0][1] = f[0][1] * (n - 2) + f[1][1] * (n - 1) + f[0][0];
	g[1][0] = f[1][0] * (m - 2) + f[1][1] * (m - 1) + f[0][0];
	g[0][0] = f[1][0] + f[0][1] + f[0][0] * (n + m - 4);
	f[0][0] = g[0][0] % mod;
	f[0][1] = g[0][1] % mod;
	f[1][0] = g[1][0] % mod;
	f[1][1] = g[1][1] % mod;
}