#include <bits/stdc++.h>
using namespace std;
const unsigned long long int M = 3e2 + 5, LG = 26, inf = 1e18 + 1,
                             mod = 95542721;
unsigned long long int x, y, k, n;
unsigned long long int dp[M][M];
unsigned long long int vaz[M];
unsigned long long int oly[M];
unsigned long long int c[M];
unsigned long long int calc() {
  for (int i = 0; i < n + 1; i++)
    for (int k = 0; k < M; k++) {
      dp[i][k] = 0;
    }
  dp[0][0] = 1;
  for (int i = 0; i < n; i++)
    for (int k = 1; k < M; k++) {
      if (vaz[i] == 0 || vaz[i] == 1) dp[i + 1][k] += dp[i][k - 1];
      if (vaz[i] == 0 || vaz[i] == 2) dp[i + 1][k - 1] += dp[i][k];
      dp[i + 1][k] = min(dp[i + 1][k], inf);
      dp[i + 1][k] = min(dp[i + 1][k], inf);
    }
  return dp[n][0];
}
int main() {
  ios::sync_with_stdio(0);
  cin >> x >> y >> k;
  n = x + y - 1;
  fill(c, c + n, inf);
  for (int i = 0; i < x; i++)
    for (int j = 0; j < y; j++) {
      unsigned long long int f;
      cin >> f;
      c[i + j] = min(c[i + j], f);
    }
  iota(oly, oly + n, 0);
  sort(oly, oly + n, [](unsigned long long int a, unsigned long long int b) {
    return c[a] < c[b];
  });
  unsigned long long int res = 0;
  for (int ii = 0; ii < n; ii++) {
    unsigned long long int i = oly[ii];
    vaz[i] = 1;
    unsigned long long int f = calc();
    if (res + f < k) {
      res += f;
      vaz[i] = 2;
    }
  }
  for (int i = 0; i < x; i++) {
    for (int j = 0; j < y; j++) {
      cout << (vaz[i + j] == 1 ? '(' : ')');
    }
    cout << '\n';
  }
}
