#include <bits/stdc++.h>
using namespace std;
const int oo = 2000000009;
const double eps = 1e-9;
const int mx = 202;
int pr[mx], n, m;
int ans[mx], tot;
long long dp[mx][mx];
long long k;
long long solve(int sum, int i) {
  if (sum < 0) return 0;
  if (i == tot) return (sum == 0);
  long long &ret = dp[sum][i];
  if (ret != -1) return ret;
  ret = 0;
  if (ans[i]) return ret = solve(sum + ans[i], i + 1);
  unsigned long long tmp = solve(sum - 1, i + 1) + solve(sum + 1, i + 1);
  if (tmp > k)
    ret = k;
  else
    ret = tmp;
  return ret;
}
int main() {
  cin >> n >> m >> k;
  tot = n + m - 1;
  for (int i = 0; i < (tot); ++i) pr[i] = oo;
  for (int i = 0; i < (n); ++i) {
    int x;
    for (int j = 0; j < (m); ++j) {
      scanf("%d", &x);
      pr[i + j] = min(pr[i + j], x);
    }
  }
  vector<pair<int, int> > v;
  for (int i = 0; i < (tot); ++i) v.push_back(make_pair(pr[i], i));
  sort((v).begin(), (v).end());
  for (int i = 0; i < (tot); ++i) {
    for (int j = 0; j < (2); ++j) {
      ans[v[i].second] = j ? -1 : 1;
      memset(dp, -1, sizeof(dp));
      long long tmp = solve(0, 0);
      ;
      if (tmp >= k) break;
      k -= tmp;
    }
  }
  for (int i = 0; i < (n); ++i) {
    for (int j = 0; j < (m); ++j) printf("%c", ans[i + j] == -1 ? ')' : '(');
    printf("\n");
  }
  return 0;
}
