#include<bits/stdc++.h>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
using namespace std;
typedef unsigned long long ull;
mt19937_64 mt(time(NULL));
constexpr ull mod=1000000007998244353;
constexpr int M=5e5+5,inf=0x3f3f3f3f;
int n,m,q,rec,ql[M],qr[M],p[M],ans[M],tr[M<<2];string str;
deque<char>s;deque<int>id;vector<int>upd1[M],upd2[M];
vector<tuple<int,int,int>>qry[M];ull base,h[M],pw[M];
ull gethash(int l,int r){return (h[r]-(__int128)h[l-1]*pw[r-l+1]%mod+mod)%mod;}
void build(int l,int r,int x){
    tr[x]=inf;if (l==r) return;
    int mid=l+r>>1;build(l,mid,ls(x));build(mid+1,r,rs(x));
}
void update(int p,int c,int l=1,int r=m,int x=1){
    if (l==r) return tr[x]=c,void(); int mid=l+r>>1;
    p<=mid?update(p,c,l,mid,ls(x)):update(p,c,mid+1,r,rs(x));
    tr[x]=min(tr[ls(x)],tr[rs(x)]);
}
int query(int L,int R,int l=1,int r=m,int x=1){
    if (L<=l&&r<=R) return tr[x]; int mid=l+r>>1,rec=inf;
    if (L<=mid) rec=min(rec,query(L,R,l,mid,ls(x)));
    if (R>mid) rec=min(rec,query(L,R,mid+1,r,rs(x)));
    return rec;
}
int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n>>str;str=" "+str;base=mt();
    for (int i=1;i<=n;i++)
        if (str[i]>='A'&&str[i]<='Z') s.push_back(str[i]-'A'+'a'),id.push_back(i);
        else s.push_front(str[i]),id.push_front(i);
    s.push_front('@');id.push_front(0); cin>>m;
    for (int i=1;i<=n;i++) ql[id[i]]=i,qr[id[i]]=i;
    for (int i=2;i<=n;i++) ql[i]=min(ql[i-1],ql[i]),qr[i]=max(qr[i-1],qr[i]);
    for (int i=pw[0]=1;i<=n;i++) pw[i]=(__int128)pw[i-1]*base%mod;
    for (int i=1;i<=n;i++) h[i]=((__int128)h[i-1]*base+s[i])%mod;
    for (int i=1;i<=m;i++){
        cin>>p[i];rec=-1;
        int l=p[i],r=n;
        while (l<=r){
            int mid=l+r>>1;
            if (gethash(ql[mid],qr[mid]-p[i])==gethash(ql[mid]+p[i],qr[mid]))
                rec=mid,l=mid+1;
            else r=mid-1;
        }
        if (~rec)
            upd1[rec].emplace_back(i),
            upd2[p[i]].emplace_back(i);
    } cin>>q;
    for (int i=1;i<=q;i++){
        int k,l,r;cin>>k>>l>>r;
        qry[k].emplace_back(l,r,i);
    }
    build(1,m,1);
    for (int i=n;i;i--){
        for (auto x:upd1[i]) update(x,p[x]);
        for (auto [l,r,id]:qry[i]) ans[id]=query(l,r);
        for (auto x:upd2[i]) update(x,inf);
    }
    for (int i=1;i<=q;i++)
        printf("%d\n",ans[i]==inf?-1:ans[i]);
    return 0;
}