#include <bits/stdc++.h>
using namespace std;
const unsigned long long maxn = 200 + 5, maxlog = 25, inf = 2e9;
unsigned long long a[maxn][maxn], d[maxn], dp[maxn][maxn];
pair<unsigned long long, unsigned long long> b[maxn];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  unsigned long long n, m, k;
  cin >> n >> m >> k;
  unsigned long long c = n + m - 1;
  fill(b, b + c + 1, pair<unsigned long long, unsigned long long>(inf, inf));
  for (unsigned long long i = 1; i <= n; i++) {
    for (unsigned long long j = 1; j <= m; j++) {
      cin >> a[i][j];
      unsigned long long x = i + j - 1;
      if (a[i][j] >= b[x].first) continue;
      b[x] = pair<unsigned long long, unsigned long long>(a[i][j], x);
    }
  }
  sort(b + 1, b + c + 1);
  for (unsigned long long q = 1; q <= c; q++) {
    d[b[q].second] = 1;
    if (d[1] <= 1) dp[1][1] = 1;
    for (unsigned long long i = 2; i <= c; i++) {
      for (unsigned long long j = 0; j <= c; j++) {
        if (d[i] == 1) {
          if (j) dp[i][j] = dp[i - 1][j - 1];
        } else if (d[i] == 2)
          dp[i][j] = dp[i - 1][j + 1];
        else {
          dp[i][j] = dp[i - 1][j + 1];
          if (j) dp[i][j] += dp[i - 1][j - 1];
        }
        dp[i][j] = min(dp[i][j], k + 1);
      }
    }
    if (dp[c][0] < k) {
      k -= dp[c][0];
      d[b[q].second] = 2;
    }
    for (unsigned long long i = 1; i <= c; i++) fill(dp[i], dp[i] + c + 1, 0);
  }
  for (unsigned long long i = 1; i <= n; i++) {
    for (unsigned long long j = 1; j <= m; j++) {
      unsigned long long x = d[i + j - 1];
      if (x == 1)
        cout << '(';
      else
        cout << ')';
    }
    cout << endl;
  }
  return 0;
}
