#include<bits/stdc++.h>
using namespace std;
inline char nc(){static char buf[1000000],*p=buf,*q=buf;return p==q&&(q=(p=buf)+fread(buf,1,1000000,stdin),p==q)?EOF:*p++;}inline int read(){int res=0,w=1;char c=nc();while(c<'0'||c>'9'){if(c=='-')w=-w;c=nc();}while(c<='9'&&c>='0')res=res*10+c-'0',c=nc();return res*w;}char obuf[1<<21],*p3=obuf;inline void pc(char c){p3-obuf<=(1<<20)?(*p3++=c):(fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=c);}inline void write(long long x){if(x<0)pc('-'),x=-x;if(x>9)write(x/10);pc(x%10+'0');}
#define ULL unsigned long long
const int maxn=5e5+5,base1=233,base2=377,inf=1e9,mod1=1e9+7,mod2=1e9+9;
inline int add(int a,int b,int mod){
    (a+=b)>=mod&&(a-=mod);return a;
}
inline int mul(int a,int b,int mod){
    return 1ll*a*b%mod;
}
int Hash1[maxn],Hash2[maxn],km1[maxn],km2[maxn];
struct seqin{
    int l,r,id;
};
struct option{
    int op,wp;
};
int n,m,q,ans[maxn],la[maxn],ra[maxn];
vector<seqin> sq[maxn];
vector<int> p[maxn],modi[maxn];
char d[maxn];
void Init(){
    static char pre[maxn],suf[maxn];
    int Cnt1=0,Cnt2=0;
    for(int i=1;i<=n;i++){
        if('a'<=d[i] and d[i]<='z'){
            pre[++Cnt1]=d[i];
        }else{
            suf[++Cnt2]=d[i]-'A'+'a';
        }
        la[i]=Cnt1,ra[i]=Cnt2;
    }
    for(int i=1;i<=n;i++){
        ra[i]=ra[i]+la[i],la[i]=Cnt1-la[i]+1,ra[i]=la[i]+ra[i]-1;
    }
    for(int i=Cnt1;i>=1;i--)d[i]=pre[Cnt1-i+1];
    for(int i=1;i<=Cnt2;i++)d[i+Cnt1] = suf[i];
    int Cnt=Cnt1+Cnt2;
    for(int i=(km1[0]=km2[0]=1);i<=Cnt;i++){
        Hash1[i]=add(mul(Hash1[i-1],base1,mod1),(d[i]-'a'+1),mod1),km1[i]=mul(km1[i-1],base1,mod1);
        Hash2[i]=add(mul(Hash2[i-1],base2,mod2),(d[i]-'a'+1),mod2),km2[i]=mul(km2[i-1],base2,mod2);
    }
}
inline pair<int,int> H(int l,int r){
    return make_pair(add(Hash1[r],mod1-mul(Hash1[l-1],km1[r-l+1],mod1),mod1),add(Hash2[r],mod2-mul(Hash2[l-1],km2[r-l+1],mod2),mod2));
}
inline bool Inw(int i,int p){
    return H(la[i]+p,ra[i])==H(la[i],ra[i]-p);
}
int Tre[maxn*4];
void Build(int u,int stdl,int stdr){
    Tre[u]=inf;
    if(stdl==stdr)return;
    int mid=(stdl+stdr>>1),lson=(u<<1),rson=lson+1;Build(lson,stdl,mid),Build(rson,mid+1,stdr);
}
void modify(int u,int stdl,int stdr,int x,int val){
    if(stdl==stdr){
        Tre[u]=val;return;
    }
    int mid=(stdl+stdr>>1),lson=(u<<1),rson=lson+1;
    if(x<=mid){
        modify(lson,stdl,mid,x,val);
    }else{
        modify(rson,mid+1,stdr,x,val);
    }
    Tre[u]=min(Tre[lson],Tre[rson]);
}
int query(int u,int stdl,int stdr,int l,int r){
    if(stdl==l and stdr==r){
        return Tre[u];
    }
    int mid=(stdl+stdr)>>1,lson=(u<<1),rson=lson+1;
    if(r<=mid)return query(lson,stdl,mid,l,r);else if(l>=mid+1)return query(rson,mid+1,stdr,l,r);
    else{
        return min(query(lson,stdl,mid,l,mid),query(rson,mid+1,stdr,mid+1,r));
    }
}
int main(){
    n=read();
    for(int i=1;i<=n;i++){
        static char c=nc();while((c<'a'||'z'<c) and (c<'A'||'Z'<c))c=nc();d[i]=c,c=nc();
    }
    Init();
    m=read();
    for(int i=1,vp;i<=m;i++){
        vp=read(),p[vp].emplace_back(i);
    }
    q=read();
    for(int i=1,k,l,r;i<=q;i++){
        k=read(),l=read(),r=read(),sq[k].emplace_back(seqin{l,r,i});
    }
    for(int p=1;p<=n;p++){
        int l=p,r=n,lim=p;
        while(l<=r){
            int mid=(l+r)>>1;
            if(Inw(mid,p)){
                lim=mid,l=mid+1;
            }else{
                r=mid-1;
            }
        }
        modi[lim+1].emplace_back(p);//表示删除
    }
    Build(1,1,m);
    for(int i=1;i<=n;i++){
        for(int pos:p[i])modify(1,1,m,pos,i);
        for(int del:modi[i]){
            for(int pos:p[del])modify(1,1,m,pos,inf);
        }
        for(seqin qm:sq[i]){
            ans[qm.id]=query(1,1,m,qm.l,qm.r);
        }
    }
    for(int i=1;i<=q;i++){
        if(ans[i]==inf)write(-1),pc('\n');else write(ans[i]),pc('\n');
    }
    return fwrite(obuf,p3-obuf,1,stdout),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
*/