#include <bits/stdc++.h>
using namespace std;
using namespace rel_ops;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const long long inf = 2000000000000000000LL;
struct CF123C {
  long long count(string& preset) {
    int n = ((int)(preset).size());
    vector<vector<long long> > cnt_lvl(n, vector<long long>(n + 10));
    if (preset[0] == ')') return 0;
    cnt_lvl[0][1] = 1;
    for (int i = 1; i < n; i++) {
      for (int j = 0; j < n + 5; j++) {
        if (j && preset[i] != ')') cnt_lvl[i][j] += cnt_lvl[i - 1][j - 1];
        if (preset[i] != '(') cnt_lvl[i][j] += cnt_lvl[i - 1][j + 1];
        cnt_lvl[i][j] = min(cnt_lvl[i][j], inf);
      }
    }
    return cnt_lvl[n - 1][0];
  }
  string solve1(vector<int>& prio, long long k) {
    int n = ((int)(prio).size());
    vector<pair<int, int> > prio1(n);
    for (int i = 0; i < (n); i++) prio1[i] = make_pair(prio[i], i);
    sort((prio1).begin(), (prio1).end());
    string t;
    for (int i = 0; i < (n); i++) t += '.';
    for (typeof((prio1).begin()) it = (prio1).begin(); it != (prio1).end();
         ++it) {
      assert(k < count(t));
      int pos = (*it).second;
      t[pos] = '(';
      long long cnt = count(t);
      if (k >= cnt) {
        k -= cnt;
        t[pos] = ')';
      }
    }
    return t;
  }
  void solve(int n, int m, long long k, vector<vector<int> >& prio) {
    vector<int> prio1(n + m - 1, 1010101010);
    for (int i = 0; i < (n); i++)
      for (int j = 0; j < (m); j++)
        prio1[i + j] = min(prio1[i + j], prio[i][j]);
    string s = solve1(prio1, k);
    for (int i = 0; i < (n); i++) {
      for (int j = 0; j < (m); j++) cout << s[i + j];
      puts("");
    }
  }
};
int main() {
  int n, m;
  long long k;
  cin >> n >> m >> k;
  k--;
  vector<vector<int> > prio(n, vector<int>(m));
  for (int i = 0; i < (n); i++)
    for (int j = 0; j < (m); j++) cin >> prio[i][j];
  CF123C x;
  x.solve(n, m, k, prio);
}
