#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<bitset>
#include<set>
#include<map>
using namespace std;
#define LL long long
#define pi (4*atan(1.0))
#define eps 1e-8
#define bug(x)  cout<<"bug"<<x<<endl;
const int N=8e5+100,M=1e6+10,inf=1e9+10;
const LL INF=1e18+10,mod=998244353;struct Chairmantree
{int rt[N*20],ls[N*20],rs[N*20],sum[N*20];int tot;void init(){tot=0;memset(ls,0,sizeof(ls));memset(rs,0,sizeof(rs));memset(sum,0,sizeof(sum));memset(rt,0,sizeof(rt));}void build(int l,int r,int &pos){pos=++tot;sum[pos]=0;if(l==r)return;int mid=(l+r)>>1;build(l,mid,ls[pos]);build(mid+1,r,rs[pos]);}void update(int p,int c,int pre,int l,int r,int &pos){pos=++tot;ls[pos]=ls[pre];rs[pos]=rs[pre];sum[pos]=sum[pre]+c;if(l==r)return;int mid=(l+r)>>1;if(p<=mid)update(p,c,ls[pre],l,mid,ls[pos]);elseupdate(p,c,rs[pre],mid+1,r,rs[pos]);}int rank(int s,int e,int L,int R,int l,int r){if(L<=l&&r<=R)return sum[e]-sum[s];int mid=(l+r)>>1;int ans=0;if(L<=mid)ans+=rank(ls[s],ls[e],L,R,l,mid);if(R>mid)ans+=rank(rs[s],rs[e],L,R,mid+1,r);return ans;}int query(int L,int R,int l,int r,int k){if(l==r)return l;int mid=(l+r)>>1;int num=sum[ls[R]]-sum[ls[L]];if(k<=num)return query(ls[L],ls[R],l,mid,k);else return query(rs[L],rs[R],mid+1,r,k-num);}
};
Chairmantree tree;
int a[N],b[N];
struct is
{int l,r,k1,k2,x;
}q[N];
int getpos(int x,int cnt)
{int pos=lower_bound(b+1,b+cnt,x)-b;return pos;
}
int main()
{int n,m;while(~scanf("%d%d",&n,&m)){for(int i=1;i<=n;i++){scanf("%d",&a[i]);b[i]=a[i];}for(int i=1;i<=m;i++){scanf("%d%d%d%d%d",&q[i].l,&q[i].r,&q[i].x,&q[i].k1,&q[i].k2);b[n+i]=q[i].x;}sort(b+1,b+1+n+m);int num=unique(b+1,b+1+n+m)-b;tree.init();tree.build(1,num-1,tree.rt[0]);for(int i=1;i<=n;i++){int p=getpos(a[i],num);tree.update(p,1,tree.rt[i-1],1,num-1,tree.rt[i]);}//for(int i=1;i<num;i++)//    printf("%d ",tree.rt[i]);//printf("\n");for(int i=1;i<=m;i++){int l=q[i].l,r=q[i].r,x=q[i].x,k1=q[i].k1,k2=q[i].k2;int p1=getpos(x,num);int p=tree.rank(tree.rt[l-1],tree.rt[r],1,p1,1,num-1);//cout<<"xxx "<<p<<" "<<num-1<<endl;int ans1=-1,ans2=-1;if(p>=k1)ans1=tree.query(tree.rt[l-1],tree.rt[r],1,num-1,k1);if(p+k2<=(r-l+1))ans2=tree.query(tree.rt[l-1],tree.rt[r],1,num-1,p+k2);//printf("%d\n",b[tree.query(tree.rt[l-1],tree.rt[r],1,num-1,k)]);if(ans1!=-1)printf("%d ",b[ans1]);else printf("-1 ");if(ans2!=-1)printf("%d\n",b[ans2]);else printf("-1\n");}}return 0;
}