Problem: Alice had a permutation p_1, p_2, …, p_n. Unfortunately, the permutation looked very boring, so she decided to change it and choose some non-overlapping subranges of this permutation and reverse them. The cost of reversing a single subrange [l, r] (elements from position l to position r, inclusive) is equal to r - l, and the cost of the operation is the sum of costs of reversing individual subranges. Alice had an integer c in mind, so she only considered operations that cost no more than c.

Then she got really bored, and decided to write down all the permutations that she could possibly obtain by performing exactly one operation on the initial permutation. Of course, Alice is very smart, so she wrote down each obtainable permutation exactly once (no matter in how many ways it can be obtained), and of course the list was sorted lexicographically.

Now Bob would like to ask Alice some questions about her list. Each question is in the following form: what is the i-th number in the j-th permutation that Alice wrote down? Since Alice is too bored to answer these questions, she asked you to help her out.

Input

The first line contains a single integer t (1 ≤ t ≤ 30) — the number of test cases.

The first line of each test case contains three integers n, c, q (1 ≤ n ≤ 3 ⋅ 10^4, 1 ≤ c ≤ 4, 1 ≤ q ≤ 3 ⋅ 10^5) — the length of the permutation, the maximum cost of the operation, and the number of queries.

The next line of each test case contains n integers p_1, p_2, ..., p_n (1 ≤ p_i ≤ n, p_i ≠ p_j if i ≠ j), describing the initial permutation.

The following q lines describe the queries. Each of them contains two integers i and j (1 ≤ i ≤ n, 1 ≤ j ≤ 10^{18}), denoting parameters of this query.

It is guaranteed that the sum of values n over all test cases does not exceed 3 ⋅ 10^5, and the sum of values q over all test cases does not exceed 3 ⋅ 10^5.

Output

For each query output the answer for this query, or -1 if j-th permutation does not exist in her list.

Examples

Input


2
3 1 9
1 2 3
1 1
2 1
3 1
1 2
2 2
3 2
1 3
2 3
3 3
6 4 4
6 5 4 3 1 2
1 1
3 14
1 59
2 6


Output


1
2
3
1
3
2
2
1
3
1
4
-1
5


Input


1
12 4 2
1 2 3 4 5 6 7 8 9 10 11 12
2 20
2 21


Output


2
2

Note

In the first test case, Alice wrote down the following permutations: [1, 2, 3], [1, 3, 2], [2, 1, 3].

Note that, for a permutation [3, 2, 1] Alice would have to reverse the whole array, and it would cost her 2, which is greater than the specified value c=1. The other two permutations can not be obtained by performing exactly one operation described in the problem statement.

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
 
using namespace std;
 
#define REP(i, a, b) for ( int i = (a), _end_ = (b); i <= _end_; ++ i ) 
#define mem(a) memset ( (a), 0, sizeof ( a ) ) 
#define str(a) strlen ( a ) 
#define pii pair<int, int>
#define int long long
typedef long long LL;
 
const int maxn = 3e5 + 10;
const int INF = 1e18;
 
int T, n, c, q, a[maxn], f[maxn][5], g[maxn][5][5], h[maxn][5][5], dp[maxn][5], C[maxn][5];
vector<pii> Ans;
 
inline int Find(int pos, int now, int y)
{
    int l = pos, r = n, ans = n + 1;
    while ( l <= r ) 
    {
        int Mid = l + r >> 1;
        if ( y <= dp[Mid][now] - dp[pos - 1][now] || y > dp[Mid][now] - dp[pos - 1][now] + h[Mid][now][0] )
        {
            ans = Mid; r = Mid - 1;
        }
        else l = Mid + 1;
    }
    return ans;
}
 
signed main()
{
    scanf("%lld", &T); n = maxn - 10; 
    C[0][0] = 1; REP(i, 1, n) { C[i][0] = 1; REP(j, 1, 4) C[i][j] = C[i - 1][j - 1] + C[i - 1][j]; }
    REP(i, 1, n) REP(j, 0, 4) REP(k, 0, j) f[i][j] += C[i - 1][k]; REP(i, 0, 4) f[0][i] = 1;
    while ( T -- ) 
    {
        scanf("%lld%lld%lld", &n, &c, &q);
        REP(i, 1, n) scanf("%lld", &a[i]);
 
        REP(i, 1, n) REP(now, 0, c)
        {
            vector<pii> p; p.clear(); REP(j, i, min(n, i + now)) p.push_back(pii(a[j], j));
            sort(p.begin(), p.end()); int sum = 0, k = 0;
            for ( auto it : p ) 
            {
                int j = it.second; g[i][now][k ++] = j; h[i][now][j - i] = f[n - j][now - j + i];
                if ( j > i ) sum += f[n - j][now - j + i];
                else dp[i][now] = dp[i - 1][now] + sum;
            }
        }
 
        while ( q -- ) 
        {
            int x, y, now = c; scanf("%lld%lld", &x, &y);
            if ( y > f[n][c] ) { puts("-1"); continue ; } 
            int pos = 1, nxt; Ans.clear();
            while ( pos <= n ) 
            {
                nxt = Find(pos, now, y); if ( nxt == n + 1 ) break ; 
                y -= dp[nxt - 1][now] - dp[pos - 1][now];
                assert(y>=0);
                REP(i, 0, c)
                {
                    int t = g[nxt][now][i];
                    if ( y <= h[nxt][now][t - nxt] )
                    {
                        Ans.push_back(pii(nxt, t));
                        now -= t - nxt; pos = t + 1; break ; 
                    }
                    y -= h[nxt][now][t - nxt];
                }
            }
            for ( auto it : Ans ) if ( it.first <= x && x <= it.second ) 
            {
                printf("%lld\n", a[it.second - x + it.first]);
                goto Finish;
            }
            printf("%lld\n", a[x]);
Finish : ;
        }
    }
    return 0;
}