#include <bits/stdc++.h>
using namespace std;
template <class T>
int chkmax(T& a, T b) {
  if (b > a) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
int chkmin(T& a, T b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <class iterator>
void output(iterator begin, iterator end, ostream& out = cerr) {
  while (begin != end) {
    out << (*begin) << " ";
    begin++;
  }
  out << endl;
}
template <class T>
void output(T x, ostream& out = cerr) {
  output(x.begin(), x.end(), out);
}
void fast_io() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
const int INF = 1e9 + 228;
const int mx = 3600;
int n, m, k, a[mx], val[mx];
void solve() {
  cin >> n >> m >> k;
  m--;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  chkmin(k, m);
  for (int i = 0; i <= m; ++i) {
    val[i] = max(a[i], a[n - 1 - (m - i)]);
  }
  int ans = 0;
  for (int i = 0; i <= k; ++i) {
    int cur = INF;
    for (int j = i; j <= i + m - k; ++j) {
      chkmin(cur, val[j]);
    }
    chkmax(ans, cur);
  }
  cout << ans << "\n";
}
signed main() {
  fast_io();
  int T;
  cin >> T;
  while (T--) {
    solve();
  }
}
