#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
const double eps = 1e-8;
const long long mod = 1e9 + 7;
const int inf = 1 << 30;
const int maxn = 600500;
vector<int> segT[maxn * 8];
int a[maxn], b[maxn], g[105][105];
int n, m;
bool vi[maxn];
void solve() {
  scanf("%d%d", &n, &m);
  int h;
  scanf("%d", &h);
  for (int i = 0; i < (int)(m); ++i) scanf("%d", &a[i]);
  for (int i = 0; i < (int)(n); ++i) scanf("%d", &b[i]);
  for (int i = 0; i < (int)(n); ++i)
    for (int j = 0; j < (int)(m); ++j) scanf("%d", &g[i][j]);
  for (int i = n - 1; i >= 0; i--) {
    bool f = 0;
    for (int j = 0; j < (int)(m); ++j)
      if (!vi[j] && g[i][j] && a[j] <= b[i]) {
        vi[j] = 1;
        f |= (g[i][j] == b[i]);
        g[i][j] = a[j];
      }
    if (!f) {
      for (int j = 0; j < (int)(m); ++j)
        if (g[i][j] && a[j] >= b[i]) {
          g[i][j] = b[i];
          break;
        }
    }
  }
  for (int i = 0; i < (int)(n); ++i)
    for (int j = 0; j < (int)(m); ++j) {
      printf("%d%c", g[i][j], " \n"[j + 1 == m]);
    }
}
int main() {
  int tc = 1;
  for (int tt = 0; tt < (int)(tc); ++tt) {
    solve();
  }
}
