//Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
using namespace std;
int main()
{


    int t;
    scanf("%d", &t);

    int z;
    for(z = 1; z <= t; z++){
        int n, k;
        scanf("%d %d", &n, &k);
        int i, temp;
        vector<int> vec;
        for(i = 1; i <= n; i++){
            scanf("%d", &temp);
            vec.push_back(temp);
        }
        //code for checking attempts.
        int first, last;
        printf("Case %d:\n", z);
        int ans = 0;
        for(i = 1; i <= k; i++){
            scanf("%d %d",&first, &last);

            int p, q;
            if(first != last){
                p = first - 1;
                for(; p < last - 1; ){
                    for(q = p + 1; q <= last - 1; q++){

                        if(vec[p] > vec[q]){
                            p = q;
                            if(p == last - 1) ans = vec[p];
                            break;
                        }
                    }
                    if(q == last - 1){
                        ans = vec[p];
                        break;
                    }
                }
            }
            else ans = vec[first - 1];
            printf("%d\n", ans);
    /*for(it = vec2.begin(); it != vec2.end(); it++){
        cout << *it << endl;
    } */

        }




    }


    return 0;
}