The 6th Zhejiang Provincial Collegiate Programming Contest->ProblemK：K-Nice

#include<bits/stdc++.h>
using namespace std;
int main()
{
int T, n, m, k, i, j;
scanf("%d", &T);
while(T--) {
scanf("%d%d%d", &n, &m, &k);
k = (n-2)*(m-2) - k;//不符合条件的矩阵
for(i = 1; i <= n; i++) {
printf("0");
for(j = 1; j <= m-2; j++) {
if(k>0)
printf(" %d", k--);
else
printf(" 0");
}
printf(" 0\n");
}
}
return 0;
}