#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 100 + 4;
const long long INF = 1000 * 1000 * 1000 + 10;
long long nmat, mmat, n;
long long k;
long long arr[2 * MAXN];
long long blar[2 * MAXN];
set<pair<long long, int> > s;
long long dp[2 * MAXN][2 * MAXN];
long long mat[MAXN][MAXN];
long long foo() {
  for (long long i = 0; i < n; i++) memset(dp[i], 0, sizeof dp[i]);
  dp[0][0] = 0;
  dp[0][1] = 1;
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < n; j++) {
      if (i == 0 && (j == 0 || j == 1)) continue;
      if (blar[i] == 0) {
        if (i && j) dp[i][j] = dp[i - 1][j - 1];
        if (i) dp[i][j] += dp[i - 1][j + 1];
      }
      if (blar[i] == 1)
        if (i && j) dp[i][j] = dp[i - 1][j - 1];
      if (blar[i] == 2)
        if (i) dp[i][j] = dp[i - 1][j + 1];
      if (dp[i][j] >= (long long)1e18 + 30) dp[i][j] = (long long)1e18 + 30;
    }
  return dp[n - 1][0];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> nmat >> mmat >> k;
  n = nmat + mmat - 1;
  fill(arr, arr + nmat + mmat - 1, INF);
  for (long long i = 0; i < nmat; i++)
    for (long long u, j = 0; j < mmat; j++) {
      cin >> u;
      arr[i + j] = min(arr[i + j], u);
    }
  for (long long i = 0; i < n; i++) s.insert({arr[i], i});
  for (auto it = s.begin(); it != s.end(); it++) {
    long long u = it->second;
    blar[u] = 1;
    long long cnt = foo();
    if (cnt >= k) continue;
    k -= cnt;
    blar[u] = 2;
  }
  for (long long i = 0; i < nmat; i++) {
    for (long long j = 0; j < mmat; j++) cout << (blar[i + j] == 1 ? '(' : ')');
    cout << '\n';
  }
}
