#include<cstdio>

#include<cstring>

#include<cctype>

#include<algorithm>

using namespace std;

#define rep(i,s,t) for(int i=s;i<=t;i++)

#define dwn(i,s,t) for(int i=s;i>=t;i--)

#define clr(x,c) memset(x,c,sizeof(x))

int read(){

	int x=0;char c=getchar();

	while(!isdigit(c)) c=getchar();

	while(isdigit(c)) x=x*10+c-'0',c=getchar();

	return x;

}

const int nmax=5e4+5;

struct node{

	node *l, *r;int sm;

};

node *rt[nmax],ns[nmax*20],*pt=ns;

int a[nmax],b[nmax];

node* build(int l,int r){

	node *p=pt++;p->sm=0;

	if(l==r) return p;

	int mid=(l+r)>>1;

	p->l=build(l,mid);p->r=build(mid+1,r);

	return p;

}

node* update(int x,int add,node *t,int l,int r){

	node *p=pt++;p->sm=t->sm+add;

	if(l==r) return p;

	int mid=(l+r)>>1;

	if(x<=mid) p->r=t->r,p->l=update(x,add,t->l,l,mid);

	else p->l=t->l,p->r=update(x,add,t->r,mid+1,r);

	return p;

}

int query(node *t,node *s,int x,int l,int r){

	if(l==r) return l;

	int mid=(l+r)>>1;

	if(t->l->sm-s->l->sm>=x) return query(t->l,s->l,x,l,mid);

	return query(t->r,s->r,x-t->l->sm+s->l->sm,mid+1,r);

}

int main(){

	int n=read(),u,v,d;

	rep(i,1,n) a[i]=b[i]=read();

	sort(b+1,b+n+1);

	int cnt=unique(b+1,b+n+1)-b-1;

	rt[0]=build(1,cnt);

	rep(i,1,n) {

		u=lower_bound(b+1,b+cnt+1,a[i])-b;

		rt[i]=update(u,1,rt[i-1],1,cnt);

	}

	int m=read();

	rep(i,1,m){

		u=read()+1,v=read()+1,d=read();

		printf("%d\n",b[query(rt[v],rt[u-1],v-u-d+2,1,cnt)]);

	}

	return 0;

}