/*
蓝桥杯历届试题地宫寻宝dp
状态：dp[i][j][num][val] 表示从起点(1, 1)走到(i, j), 已经取了num个宝物，最大价值是val 的方案数。
初态：dp[1][1][0][0] = 1; dp[1][1][1][mp[1][1]] = 1;
转移方程：由上方或者左方的格子转移而来，详见代码；
*/#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;#define mod 1000000007
int dp[55][55][15][15];
int mp[55][55];int main() {int n, m, k;while(~scanf("%d%d%d", &n, &m, &k)) {for (int i=1; i<=n; ++i) {for (int j=1; j<=m; ++j) {scanf("%d", &mp[i][j]);}}memset(dp, 0, sizeof(dp));dp[1][1][0][0] = 1;dp[1][1][1][mp[1][1]] = 1;for (int i=1; i<=n; ++i) {for (int j=1; j<=m; ++j) {dp[i][j][0][0] += (dp[i-1][j][0][0] + dp[i][j-1][0][0]);dp[i][j][0][0] %= mod;for (int num=1; num<=k; ++num) {for (int val=0; val<=12; ++val) {dp[i][j][num][val] += (dp[i-1][j][num][val] + dp[i][j-1][num][val]);dp[i][j][num][val] %= mod;}if (num == 1) {dp[i][j][1][mp[i][j]] += dp[i-1][j][0][0];dp[i][j][1][mp[i][j]] %= mod;dp[i][j][1][mp[i][j]] += dp[i][j-1][0][0];dp[i][j][1][mp[i][j]] %= mod;}else {for (int t=0; t<mp[i][j]; ++t) {dp[i][j][num][mp[i][j]] += dp[i-1][j][num-1][t];dp[i][j][num][mp[i][j]] %= mod;dp[i][j][num][mp[i][j]] += dp[i][j-1][num-1][t];dp[i][j][num][mp[i][j]] %= mod;}}}}}int ans = 0;for (int i=0; i<=12; ++i) {ans += dp[n][m][k][i];ans %= mod;}printf("%d\n", ans);}return 0;
}

/*
蓝桥杯历届试题 地宫取宝dp[i][j][num][k] 表示到位置(i, j)时, 取了第num个宝藏，最大宝藏值是k时，
能到终点的路线方案数。dfs超时。
记忆化搜索...
*/#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
#define mod 1000000007int dp[55][55][15][15];
int n, m, k;
int mp[55][55];int dfs(int nowx, int nowy, int cnt, int nowMax) {if (dp[nowx][nowy][cnt][nowMax+1] != -1) {return dp[nowx][nowy][cnt][nowMax+1];}int ans = 0;if (nowx == n-1 && nowy == m-1) {if (mp[nowx][nowy] > nowMax) {if (cnt == k || cnt == k-1)ans++;ans %= mod;}else if (cnt == k) ans++;ans %= mod;return dp[nowx][nowy][cnt][nowMax+1] = ans;}if (nowx+1 < n) {if (mp[nowx][nowy] > nowMax) {ans += dfs(nowx+1, nowy, cnt+1, mp[nowx][nowy]);ans %= mod;}ans += dfs(nowx+1, nowy, cnt, nowMax);ans %= mod;}if (nowy+1 < m) {if (mp[nowx][nowy] > nowMax) {ans += dfs(nowx, nowy+1, cnt+1, mp[nowx][nowy]);ans %= mod;}ans += dfs(nowx, nowy+1, cnt, nowMax);ans %= mod;}return dp[nowx][nowy][cnt][nowMax+1] = ans;
}int main() {while(~scanf("%d%d%d", &n, &m, &k)) {memset(dp, -1, sizeof(dp));for (int i=0; i<n; ++i) {for (int j=0; j<m; ++j) {scanf("%d", &mp[i][j]);}}int ans = dfs(0, 0, 0, -1);printf("%d\n", ans);}return 0;
}