#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long INFF = 1000000000000000001LL;
const double PI = 3.141592653589793;
long long wyn[205][205], k, f;
int n, m, res[205], i, j, P[105][105], k1, k2, d, l;
pair<int, int> poz[10005];
long long szukaj(int k, int a) {
  int i, j;
  res[k] = a;
  wyn[0][1] = 1;
  for (i = 1; i < l; i++) {
    for (j = 0; j <= i + 1; j++) wyn[i][j] = 0;
    if (res[i] == 0 || res[i] == -1) {
      for (j = 1; j <= i + 1; j++) wyn[i][j] += wyn[i - 1][j - 1];
    }
    if (res[i] == 1 || res[i] == -1) {
      for (j = 0; j < i; j++)
        wyn[i][j] = min(wyn[i][j] + wyn[i - 1][j + 1], INFF);
    }
  }
  res[k] = -1;
  return wyn[l - 1][0];
}
int main() {
  cin >> n >> m >> k;
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++) {
      scanf("%d", &P[i][j]);
      poz[P[i][j]] = pair<int, int>(i, j);
    }
  l = n + m - 1;
  for (i = 0; i < l; i++) res[i] = -1;
  res[0] = 0;
  res[l - 1] = 1;
  for (i = 1; i <= n * m; i++) {
    k1 = poz[i].first;
    k2 = poz[i].second;
    d = k1 + k2;
    if (res[d] != -1) continue;
    f = szukaj(d, 0);
    if (f >= k)
      res[d] = 0;
    else {
      res[d] = 1;
      k -= f;
    }
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++)
      if (res[i + j] == 0)
        printf("(");
      else
        printf(")");
    printf("\n");
  }
  return 0;
}
