1
10 2 20
8 5 2 4 10 3 9 7 1 6
5 10
3 17
6 31
3 46
10 42
7 19
9 36
7 3
3 13
8 32
10 25
9 34
10 34
6 33
3 9
2 17
4 5
10 44
9 15
5 40
 1
47 1 47
40 45 19 10 44 33 47 12 2 46 16 23 3 14 21 28 31 42 22 18 35 38 24 25 36 32 4 34 5 20 37 39 6 9 1 7 29 8 17 27 30 11 13 41 15 43 26
39 25
41 24
32 30
10 6
30 13
24 35
41 17
31 31
9 44
21 8
43 23
8 5
29 13
8 4
47 20
22 10
37 27
17 39
43 23
14 42
46 19
43 24
30 31
24 35
31 13
31 32
20 9
3 2
20 9
14 7
7 3
21 36
32 30
47 19
11 43
6 2
31 31
26 12
47 20
2 1
40 24
16 40
45 21
36 28
36 28
17 38
30 31
 1
1 1 4
1
1 1
1 2
1 3
1 4
 1
10 1 1
10 4 6 5 7 9 8 1 3 2
6 10

3
2
7
10
6
7
7
7
5
1
6
6
1
9
4
4
4
1
1
3
 27
27
37
16
20
24
11
20
46
35
11
2
34
47
26
24
7
28
11
3
26
13
37
24
37
37
22
10
22
14
47
38
37
43
23
33
20
4
26
19
30
21
43
1
1
42
37
 1
-1
-1
-1
 9

#include <bits/stdc++.h>
using namespace std;
int n;
long long k;
int main() {
  int ntest;
  cin >> ntest;
  for (int test = 1; test <= ntest; test++) {
    int n, c, q;
    cin >> n >> c >> q;
    vector<int> a;
    a.clear();
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      a.push_back(x);
    }
    vector<vector<int> > ans;
    ans.push_back(a);
    for (int i = 0; i < n; i++) {
      for (int j = 1; j <= c; j++) {
        int st = i;
        int fn = i + j;
        if (fn >= n) continue;
        vector<int> v;
        v.clear();
        for (int t = 0; t < st; t++) v.push_back(a[t]);
        for (int t = fn; t >= st; t--) v.push_back(a[t]);
        for (int t = fn + 1; t < n; t++) v.push_back(a[t]);
        ans.push_back(v);
      }
    }
    sort(ans.begin(), ans.end());
    for (int i = 0; i < ans.size(); i++) {
      for (int j = 0; j < ans[i].size(); j++) cout << ans[i][j] << " ";
      cout << endl;
    }
    for (int i = 0; i < q; i++) {
      int u, v;
      cin >> u >> v;
      u--;
      v--;
      if (v >= ans.size())
        cout << -1 << endl;
      else
        cout << ans[v][u] << endl;
    }
  }
  return 0;
}
