#include <bits/stdc++.h>
using namespace std;
struct fastIO {
  inline fastIO operator>>(int& num) {
    num = 0;
    char c = getchar();
    while (c != '-' && (c < '0' || c > '9')) c = getchar();
    bool foo = 0;
    if (c == '-') {
      foo = 1;
      c = getchar();
    }
    while (c >= '0' && c <= '9') {
      num = (num << 3) + (num << 1) + c - '0';
      c = getchar();
    }
    if (foo) num = -num;
    return *this;
  }
  inline fastIO operator>>(long long& num) {
    num = 0;
    char c = getchar();
    while (c != '-' && (c < '0' || c > '9')) c = getchar();
    bool foo = 0;
    if (c == '-') {
      foo = 1;
      c = getchar();
    }
    while (c >= '0' && c <= '9') {
      num = (num << 3) + (num << 1) + c - '0';
      c = getchar();
    }
    if (foo) num = -num;
    return *this;
  }
  inline fastIO operator>>(float& num) {
    scanf("%f", &num);
    return *this;
  }
  inline fastIO operator>>(double& num) {
    scanf("%lf", &num);
    return *this;
  }
  inline fastIO operator>>(long double& num) {
    scanf("%Lf", &num);
    return *this;
  }
  inline fastIO operator>>(char& num) {
    num = getchar();
    while (num == ' ' || num == '\n') num = getchar();
    return *this;
  }
  inline fastIO operator>>(char* num) {
    int cnt = 0;
    char c = getchar();
    while (c == ' ' || c == '\n') c = getchar();
    while (c != ' ' && c != '\n') {
      num[cnt++] = c;
      c = getchar();
    }
    num[cnt] = 0;
    return *this;
  }
  inline fastIO operator>>(string& num) {
    cin >> num;
    return *this;
  }
  inline void printInt(const int& num) {
    if (num < 10) {
      putchar(num + '0');
      return;
    }
    printInt(num / 10);
    putchar((num % 10) + '0');
  }
  inline void printINT(const long long& num) {
    if (num < 10) {
      putchar(num + '0');
      return;
    }
    printINT(num / 10);
    putchar((num % 10) + '0');
  }
  inline fastIO operator<<(const int& num) {
    if (num < 0)
      putchar('-'), printInt(-num);
    else
      printInt(num);
    return *this;
  }
  inline fastIO operator<<(const long long& num) {
    if (num < 0)
      putchar('-'), printINT(-num);
    else
      printINT(num);
    return *this;
  }
  inline fastIO operator<<(const float& num) {
    printf("%.10f", num);
    return *this;
  }
  inline fastIO operator<<(const double& num) {
    printf("%.16lf", num);
    return *this;
  }
  inline fastIO operator<<(const long double& num) {
    printf("%.20Lf", num);
    return *this;
  }
  inline fastIO operator<<(const char& num) {
    putchar(num);
    return *this;
  }
  inline fastIO operator<<(const char* num) {
    for (int i = 0; num[i]; i++) putchar(num[i]);
    return *this;
  }
  inline fastIO operator<<(const string& num) {
    cout << num;
    return *this;
  }
} fio;
int n, m, k;
int a[15][15];
int dy[15], dy2[15];
int fi11[15][15];
int dp[15][15];
int dfs(int x, int y, int used) {
  if (x == n) {
    memset((void*)dy, 0, sizeof(dy));
    memset((void*)dy2, 0, sizeof(dy2));
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        if (a[i][j]) {
          if (dy[fi11[i][j]] && dy[fi11[i][j]] != a[i][j]) {
            return 0;
          }
          if (dy2[a[i][j]] && dy2[a[i][j]] != fi11[i][j]) {
            return 0;
          }
          dy[fi11[i][j]] = a[i][j];
          dy2[a[i][j]] = fi11[i][j];
        }
      }
    }
    int kb = k - used, kk = k;
    for (int i = 1; i <= used; i++) {
      if (dy[i]) {
        kk--;
      }
    }
    int ans = 1;
    for (int i = kk; i > kb; i--) {
      ans *= i;
    }
    return ans;
  }
  dp[x][y] = ((x > 0 ? dp[x - 1][y] : 0) | (y > 0 ? dp[x][y - 1] : 0));
  int cnt = 0;
  for (int i = 1; i <= min(used + 1, k); i++) {
    if (!(((dp[x][y]) >> (i)) & 1)) {
      dp[x][y] ^= (1 << (i));
      fi11[x][y] = i;
      if (y < m - 1) {
        cnt += dfs(x, y + 1, min(max(used, i), k));
      } else {
        cnt += dfs(x + 1, 0, min(max(used, i), k));
      }
      if (cnt > 1000000007) {
        cnt -= 1000000007;
      }
      fi11[x][y] = 0;
      dp[x][y] ^= (1 << (i));
    }
  }
  return cnt;
}
int main() {
  fio >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      fio >> a[i][j];
    }
  }
  fio << dfs(0, 0, 0) << '\n';
  return 0;
}
