#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n,m,x,y,i,j,ans;
struct nod{
    int val;
};
nod* v[250001];
vector<nod*> g[250001],st;
void dfs(int x){
    if(x != 0){
        v[x]->val = 0;
        dfs(g[x][0]->val);
        for(int i=st.size()-1;i>=0;i--)
            g[x].push_back(st[i]);
        st.push_back(g[x][0]);
    }else
        st.clear();
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++){
        fin>>x;
        v[i] = new nod();
        v[i]->val = x;
        g[i].push_back(v[i]);
        v[i] = new nod();
        v[i]->val = x;
    }
    for(i=n;i>0;i--)
        if(v[i]->val != 0)
            dfs(i);
    while(m--){
        fin>>x>>y;
        y = min((int)g[x].size(),y);
        fout<<g[x][y-1]->val<<'\n';
    }
    for(i=1;i<=n;i++){
        cout<<i<<": ";
        for(j=0;j<g[i].size();j++)
            cout<<g[i][j]->val<<' ';
        cout<<'\n';
    }
    return 0;
}