#include<bits/stdc++.h>
#define N 500005
#define P1 131
#define I 1ll
#define P2 191
#define INF 0x3f3f3f3f
#define M 998244353
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define MP make_pair
#define ull unsigned long long
#define pui pair<ull,int>
#define INF 0x3f3f3f3f
using namespace std; 
struct SGT{
	#define ls (rt<<1)
	#define rs (rt<<1|1)
	int T[N<<3];
	void build(int rt,int l,int r){ T[rt]=INF;
		if(l==r) return; int md=(l+r)>>1;
		build(ls,l,md),build(rs,md+1,r);
	}void modf(int rt,int l,int r,int x,int d){
		if(l==r){T[rt]=d; return;} int md=(l+r)>>1;
		if(x<=md) modf(ls,l,md,x,d);
		else modf(rs,md+1,r,x,d); T[rt]=min(T[ls],T[rs]);
	}int ask(int rt,int l,int r,int L,int R){
		if(L<=l&&r<=R) return T[rt]; int md=(l+r)>>1,ret=INF;
		if(L<=md) ret=min(ret,ask(ls,l,md,L,R));
		if(R>md) ret=min(ret,ask(rs,md+1,r,L,R)); return ret; }
}T;
ull pw1[N]; int rpos[N];
int n,m,Q,ans[N],L[N],R[N],p[N],pw2[N],hd,tl,q0[N]; 
char s[N]; pui h[N];
vector<array<int,3>> qr[N];
vector<int> pos[N];
void init(){ pw1[0]=pw2[0]=1;
	for(int i=1;i<=n;i++) 
		pw1[i]=pw1[i-1]*P1,pw2[i]=I*pw2[i-1]*P2%M;
	hd=n+1,tl=n;
	for(int i=1;i<=n;i++){
		if(s[i]>='A'&&s[i]<='Z') q0[++tl]=s[i]-'A'+1;
		if(s[i]>='a'&&s[i]<='z') q0[--hd]=s[i]-'a'+1;
		L[i]=hd,R[i]=tl;
	}for(int i=hd;i<=tl;i++){
		h[i].fi=h[i-1].fi*P1+q0[i];
		h[i].se=(I*h[i-1].se*P2%M+q0[i])%M; }
}pui ask(int l,int r){
	return MP(h[r].fi-h[l-1].fi*pw1[r-l+1],(h[r].se+M-I*h[l-1].se*pw2[r-l+1]%M)%M);	
}bool eq(pui x,pui y){return x.fi==y.fi&&x.se==y.se;}
bool chk(int i,int l){ l=(R[i]-L[i]+1)-l;
	return eq(ask(L[i],L[i]+l-1),ask(R[i]-l+1,R[i]));	
}int id[N];
bool cmp(int x,int y){return rpos[x]>rpos[y];}
signed main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	scanf("%d%s%d",&n,s+1,&m);
	for(int i=1;i<=m;i++) 
		scanf("%d",&p[i]),pos[p[i]].pb(i); 
	init();
	for(int i=1;i<=n;i++){
		int l=i,r=n,ret=i; 
		while(l<=r){
			int md=(l+r)>>1;
			if(chk(md,i)) l=md+1,ret=md;
			else r=md-1; }
		rpos[i]=ret; id[i]=i;
	}sort(id+1,id+n+1,cmp);
	scanf("%d",&Q);
	for(int i=1,k,l,r;i<=Q;i++){
		scanf("%d%d%d",&k,&l,&r);
		qr[k].pb({l,r,i});
	}T.build(1,1,m);
	for(int i=n,j=1;i;i--){
		while(j&&rpos[id[j]]>=i){
			for(int u:pos[id[j]]) T.modf(1,1,m,u,p[u]);
			j++; }
		for(auto u:qr[i]){
			ans[u[2]]=T.ask(1,1,m,u[0],u[1]);
			if(ans[u[2]]>i) ans[u[2]]=-1;
		}
	}for(int i=1;i<=Q;i++) printf("%d\n",ans[i]);
	return 0;
}/*
7
AABAAba
9
4 3 2 1 7 5 3 6 1
6
1 4 4
2 1 4
2 1 3
3 3 5
5 4 7
7 8 9
*/