#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
  std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <typename T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <typename T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
void CHECKTIME(std::function<void()> f) {
  auto start = std::chrono::system_clock::now();
  f();
  auto end = std::chrono::system_clock::now();
  auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start))
                 .count();
  std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n";
}
template <class T>
std::vector<std::vector<T>> VV(int n) {
  return std::vector<std::vector<T>>(n);
}
template <class T>
std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
  return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;
constexpr int INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
int n, k, Q;
int a[13][100005];
struct P {
  int ty, x, y;
};
P p[100015];
struct QUERY {
  int ty, x, y;
};
QUERY q[100005];
std::vector<int> idx[100005];
int ans[100005];
constexpr int MAX = 1LL << 30;
int ny;
int now = 0;
PAIR memo[100015];
inline int f(int x) {
  if (memo[x].first == now) return memo[x].second;
  if (p[x].ty == -1) {
    return (memo[x] = PAIR(now, a[x][ny])).second;
  }
  if (p[x].ty == 1) {
    return (memo[x] = PAIR(now, std::max(f(p[x].x), f(p[x].y)))).second;
  }
  if (p[x].ty == 2) {
    return (memo[x] = PAIR(now, std::min(f(p[x].x), f(p[x].y)))).second;
  }
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  std::cin >> n >> k >> Q;
  for (int i = 0; i < int(k); ++i)
    for (int j = 0; j < int(n); ++j) {
      std::cin >> a[i][j];
    }
  int pos = 0;
  for (int i = 0; i < int(k); ++i) {
    p[pos++] = P{-1, -1, -1};
  }
  for (int i = 0; i < int(Q); ++i) {
    int ty, x, y;
    MACRO_VAR_Scan(ty, x, y);
    ;
    --x;
    --y;
    q[i] = QUERY{ty, x, y};
    if (ty == 3) {
      idx[y].emplace_back(i);
    } else {
      p[pos++] = P{ty, x, y};
    }
  }
  for (int y = 0; y < int(n); ++y) {
    ny = y;
    for (const auto& i : idx[y]) {
      ++now;
      ans[i] = f(q[i].x);
    }
  }
  for (int i = 0; i < int(100005); ++i) {
    if (ans[i] != 0) {
      std::cout << ans[i];
      std::cout << "\n";
      ;
    }
  }
  return 0;
}
