#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef double db;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
template <typename Type>
using vec=vector<Type>;
template <typename Type>
using grheap=priority_queue<Type>;
template <typename Type>
using lrheap=priority_queue<Type,vector<Type>,greater<Type> >;
#define fir first
#define sec second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define per(i,x,y) for(int i=x;i>=y;i--)

template<typename type>
inline void read(type &x)
{
    x=0;static bool flag(0);char ch=getchar();
    while(!isdigit(ch)) flag=ch=='-',ch=getchar();
    while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    flag?x=-x:0;
}

template<typename type>
inline void write(type x,bool mode=1)
{
    x<0?x=-x,putchar('-'):0;static short Stack[50],top(0);
    do Stack[++top]=x%10,x/=10; while(x);
    while(top) putchar(Stack[top--]|48);
    mode?putchar('\n'):putchar(' ');
}

const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7/*998244353*/;
const ll bas=131;
const ull bas2=13331;

const int N=5e5+5;

int n,m,q;
char c[N];
string s;
int ls[N],rs[N];
int p[N],ts[N],tp[N];
vec<int> plc[N];
int arr[N];
struct query{
    int k,l,r,id;
};
vec<query> ned[N];
int ans[N];

ll hsh[N],cf[N];
ull hsh2[N],cf2[N];
inline ll gethash(int l,int r){
    return (hsh[r]-hsh[l-1]*cf[r-l+1]%mod+mod)%mod;
}
inline ll gethash2(int l,int r){
    return hsh2[r]-hsh2[l-1]*cf2[r-l+1];
}

struct segment{
    int dat[N*4];
    void update(int x){
        dat[x]=min(dat[x*2],dat[x*2+1]);
    }
    void build(int x=1,int l=1,int r=m){
        dat[x]=inf;
        if(l==r)return;
        int m=l+r>>1;
        build(x*2,l,m);
        build(x*2+1,m+1,r);
        update(x);
    }
    void chg(int k,int v,int x=1,int l=1,int r=m){
        if(l==r){
            dat[x]=v;
            return;
        }
        int m=l+r>>1;
        if(k<=m)chg(k,v,x*2,l,m);
        else chg(k,v,x*2+1,m+1,r);
        update(x);
    }
    int query(int lq,int rq,int x=1,int l=1,int r=m){
        if(lq<=l&&r<=rq){
            return dat[x];
        }
        int m=l+r>>1,res=inf;
        if(lq<=m)chmin(res,query(lq,rq,x*2,l,m));
        if(m<rq)chmin(res,query(lq,rq,x*2+1,m+1,r));
        return res;
    }
}seg;

int main(){
    read(n);
    int fst;
    rep(i,1,n){
        c[i]=getchar();
        if(i==1)fst=1,s=(c[i]<'a'?c[i]-'A'+'a':c[i]);
        else{
            if('a'<=c[i]){
                s=c[i]+s;
                fst++;
            }else s=s+char(c[i]-'A'+'a');
        }
    }
    ls[1]=rs[1]=fst;
    rep(i,2,n){
        ls[i]=ls[i-1];rs[i]=rs[i-1];
        if('a'<=c[i])ls[i]--;
        else rs[i]++;
    }
    s=' '+s;
    cf[0]=cf2[0]=1;
    rep(i,1,n){
        hsh[i]=(hsh[i-1]*bas%mod+s[i])%mod;
        cf[i]=cf[i-1]*bas%mod;
        hsh2[i]=hsh2[i-1]*bas2;
        cf2[i]=cf2[i-1]*bas2;
    }
    rep(i,1,n){
        arr[i]=i;
        int l=i,r=n;
        while(l<r){
            int m=l+r+1>>1;
            int len=m-i;
            if(gethash(ls[m],ls[m]+len-1)==gethash(rs[m]-len+1,rs[m])&&
            gethash2(ls[m],ls[m]+len-1)==gethash2(rs[m]-len+1,rs[m]))l=m;
            else r=m-1;
        }
        ts[i]=l;
    }
    sort(arr+1,arr+1+n,[](int a,int b){return ts[a]<ts[b];});
    read(m);
    rep(i,1,m){
        read(p[i]);
        plc[p[i]].pub(i);
    }
    read(q);
    query tq;
    rep(i,1,q){
        read(tq.k);read(tq.l);read(tq.r);
        tq.id=i;
        ned[tq.k].pub(tq);
    }
    seg.build();
    int j=n;
    per(i,n,1){
        while(j>=1&&ts[arr[j]]>=i){
            for(auto p:plc[arr[j]])seg.chg(p,arr[j]);
            j--;
        }
        for(auto q:ned[i]){
            int res=seg.query(q.l,q.r);
            if(res>i)res=-1;
            ans[q.id]=res;
        }
    }
    rep(i,1,q)write(ans[i]);
    return 0;
}