#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 200 + 10;
const long long MAXL = 20;
const long long INF = 1e18 + 200;
char s[MAXN];
long long dp[MAXN][MAXN];
long long mul(long long a, long long b) {
  if (a == 0 || b == 0) return 0;
  if (a < INF / b)
    return min(INF, a * b);
  else
    return INF;
}
long long add(long long a, long long b) { return min(a + b, INF); }
long long calc(long long n) {
  for (long long i = n; i >= 0; i--)
    for (long long j = i; j <= n; j++) {
      long long &res = dp[i][j];
      res = 0;
      if ((j - i) % 2) continue;
      if (i == j) {
        res = 1;
        continue;
      }
      if (s[i] == ')' || s[j - 1] == '(') continue;
      for (long long k = i + 1; k < j; k += 2) {
        if (s[k] == '(') continue;
        res = add(res, mul(dp[i + 1][k], dp[k + 1][j]));
      }
    }
  return dp[0][n];
}
long long mn[MAXN];
vector<pair<long long, long long>> res;
int32_t main() {
  memset(mn, 63, sizeof mn);
  long long n, m;
  cin >> n >> m;
  long long k;
  cin >> k;
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < m; j++) {
      long long x;
      cin >> x;
      mn[i + j] = min(mn[i + j], x);
    }
  for (long long i = 0; i < n + m - 1; i++) res.push_back({mn[i], i});
  sort(res.begin(), res.end());
  for (auto v : res) {
    long long cur = v.second;
    s[cur] = '(';
    long long t = calc(m + n - 1);
    if (t < k) s[cur] = ')', k -= t;
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) cout << s[i + j];
    cout << '\n';
  }
}
