#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<pair<int, int>,null_type,less<pair<int, int>>,rb_tree_tag,tree_order_statistics_node_update>Bohemian;
int main()
{
    Bohemian st;
    int t,cnt=1;
    scanf("%d",&t);
    while(t--)
    {
        int n,q;
        scanf("%d %d",&n,&q);
        for(int i=0; i<n; i++)
        {
            int a;
            scanf("%d",&a);
            st.insert({i,a});
        }
        int hi=n-1;
        printf("Case %d:\n",cnt++);
        while(q--)
        {
            char ch;
            int p;
            cin>>ch>>p;
            if(ch=='c')
            {
                p--;
                auto it = st.find_by_order(p);
                if(it==st.end())
                    printf("none\n");
                else
                {
                    printf("%d\n",(*it).second);
                    st.erase(it);
                }
            }
            else
            {
                hi++;
                st.insert({hi,p});
            }
        }
    }
}