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 <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }

void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }

#ifdef NEAL_DEBUG
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif


void run_case() {
    int N, C, Q;
    cin >> N >> C >> Q;
    vector<int> P(N);

    for (auto &p : P)
        cin >> p;

    vector<vector<array<int64_t, 2>>> range(C + 1, vector<array<int64_t, 2>>(N + 1, {0, 1}));
    vector<vector<int64_t>> dp(C + 1, vector<int64_t>(N + 1, 0));

    for (int c = 0; c <= C; c++)
        dp[c][N] = 1;

    for (int start = N - 1; start >= 0; start--) {
        dp[0][start] = 1;

        for (int c = 1; c <= C; c++)
            for (int take = 1; take <= c + 1 && start + take <= N; take++)
                dp[c][start] += dp[c - (take - 1)][start + take];
    }

    for (int start = N - 1; start >= 0; start--)
        for (int c = 1; c <= C; c++) {
            int64_t range_start = 0, range_end = 0;

            for (int take = 1; take <= c + 1 && start + take <= N; take++) {
                int last = P[start + take - 1];

                if (last < P[start]) {
                    int64_t add = dp[c - (take - 1)][start + take];
                    range_start += add;
                    range_end += add;
                } else if (last == P[start]) {
                    int64_t add = dp[c - (take - 1)][start + take];
                    range_end += add;
                }
            }

            range[c][start] = {range_start, range_end};
        }

    vector<vector<int64_t>> range_start_sum(C + 1, vector<int64_t>(N + 2, 0));

    for (int c = 0; c <= C; c++)
        for (int i = 0; i <= N; i++)
            range_start_sum[c][i + 1] = range_start_sum[c][i] + range[c][i][0];

    for (int q = 0; q < Q; q++) {
        int64_t idx, j;
        cin >> idx >> j;
        idx--; j--;
        int c = C, answer = -1;

        if (j >= dp[C][0]) {
            cout << -1 << '\n';
            continue;
        }

        int start = 0;

        while (start < N) {
            if (range[c][start][0] <= j && j < range[c][start][1]) {
                if (idx == start) {
                    answer = P[idx];
                    goto finish;
                }

                int low = start, high = N;

                while (low < high) {
                    int mid = low + (high - low) / 2;

                    int64_t range_sum = range_start_sum[c][mid] - range_start_sum[c][start];
                    int64_t range_start = range_sum + range[c][mid][0];
                    int64_t range_end = range_sum + range[c][mid][1];

                    if (range_start <= j && j < range_end)
                        low = mid + 1;
                    else
                        high = mid;
                }

                if (start <= idx && idx < low) {
                    answer = P[idx];
                    goto finish;
                }

                j -= range_start_sum[c][low] - range_start_sum[c][start];
                start = low;
            } else {
                vector<pair<int, int>> choices;

                for (int i = start; i <= start + c && i < N; i++)
                    choices.emplace_back(P[i], i);

                sort(choices.begin(), choices.end());

                for (auto &pr : choices) {
                    int i = pr.second;
                    int take = i - start + 1;
                    int64_t add = dp[c - (take - 1)][start + take];

                    if (0 <= j && j < add) {
                        if (start <= idx && idx < start + take) {
                            answer = P[start + (start + take - 1 - idx)];
                            goto finish;
                        }

                        c -= take - 1;
                        start += take;
                        break;
                    }

                    j -= add;
                }
            }
        }

        finish:
        cout << answer << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
#ifndef NEAL_DEBUG
    cin.tie(nullptr);
#endif

    int tests;
    cin >> tests;

    while (tests-- > 0)
        run_case();
}
