#include <bits/stdc++.h>
using namespace std;
const int Max_NM(105);
struct node {
  int x, y, v;
  inline bool operator<(const node &b) const { return v < b.v; }
};
node A[Max_NM * Max_NM];
int N, M, V[Max_NM + Max_NM];
long long int K, F[Max_NM + Max_NM][Max_NM];
inline void upd(long long int &a, long long int b) { a = min(a + b, K); }
long long int dp() {
  F[0][0] = 1LL;
  for (int i = 1; i <= N + M - 1; ++i) {
    memset(F[i], 0, sizeof(F[i]));
    for (int j = 0; j <= i - 1; ++j) {
      if (V[i] != 0) upd(F[i][j + 1], F[i - 1][j]);
      if (V[i] != 1) upd(F[i][j], F[i - 1][j]);
    }
    for (int j = 0; j <= i; ++j)
      if (j - (i - j) < 0) F[i][j] = 0LL;
  }
  return F[N + M - 1][(N + M - 1) / 2];
}
int main() {
  scanf("%d%d%lld", &N, &M, &K);
  for (int i = 1, tot = 0; i <= N; ++i)
    for (int j = 1; j <= M; ++j)
      ++tot, A[tot].x = i, A[tot].y = j, scanf("%d", &A[tot].v);
  sort(A + 1, A + 1 + N * M);
  memset(V, -1, sizeof(V));
  for (int i = 1, p; i <= N * M; ++i) {
    p = A[i].x + A[i].y - 1;
    if (V[p] == -1) {
      V[p] = 1;
      long long int tmp;
      if (K > (tmp = dp())) V[p] = 0, K -= tmp;
    }
  }
  for (int i = 1; i <= N; ++i) {
    for (int j = 1; j <= M; ++j)
      if (V[i + j - 1] == 1)
        putchar('(');
      else
        putchar(')');
    putchar('\n');
  }
  return 0;
}
