#include <bits/stdc++.h>
#define re register
#define fst first
#define snd second
#define ull unsigned long long

using namespace std;

typedef pair<int,int> pii;
const int N = 5e5 + 10;
const ull base = 102401027,mod = 1e9 + 7;
int n,m,q,arr[N];
char s[N]; ull pw[N],hs[N];
int L[N],R[N],ans[N];
pii lim[N]; bool vis[N];

struct Query{
    int k,l,r,id;

    bool friend operator <(const Query &a,const Query &b){
        return a.k > b.k;
    }
}Q[N];

inline int read(){
    int r = 0,w = 1;
    char c = getchar();
    while (c < '0' || c > '9'){
        if (c == '-') w = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9'){
        r = (r << 3) + (r << 1) + (c ^ 48);
        c = getchar();
    }
    return r * w;
}

inline void init(int n){
    deque<char> q; pw[0] = 1;
    // cerr << n << " sbsb\n";
    // return;
    for (re int i = 1;i <= n;i++) pw[i] = pw[i - 1] * base % mod;
    for (re int i = 1;i <= n;i++){
        if ('a' <= s[i] && s[i] <= 'z') q.push_front(s[i]);
        else q.push_back(s[i] + 32);
    }
    for (re int i = 1;i <= n;i++){
        hs[i] = (hs[i - 1] * base + q.front()) % mod;
        q.push_back(q.front()); q.pop_front();
    }
    for (re int i = n;i;i--){
        if (i == n) L[i] = 1,R[i] = n;
        else{
            L[i] = L[i + 1],R[i] = R[i + 1];
            if ('a' <= s[i + 1] && s[i + 1] <= 'z'){
                L[i]++; q.pop_front();
            }
            else{
                R[i]--; q.pop_back();
            }
        }
    }
    // for (re int i = 1;i <= n;i++) cerr << L[i] << " " << R[i] << " ???\n";
}

inline ull get(int l,int r){
    return (hs[r] - hs[l - 1] * pw[r - l + 1] % mod + mod) % mod;
}

struct{
    #define ls(u) (u << 1)
    #define rs(u) (u << 1 | 1)
    #define v(u) (tr[u].v)

    struct node{
        int l,r;
        vector<pii> v;
    }tr[N << 2];

    inline void build(int u,int l,int r){
        tr[u] = {l,r};
        if (l == r) return;
        int mid = l + r >> 1;
        build(ls(u),l,mid); build(rs(u),mid + 1,r);
    }

    inline void modify(int u,int l,int r,pii k){
        if (l <= tr[u].l && tr[u].r <= r) return v(u).push_back(k),void();
        int mid = tr[u].l + tr[u].r >> 1;
        if (l <= mid) modify(ls(u),l,r,k);
        if (r > mid) modify(rs(u),l,r,k);
    }

    inline void update(int u,int x,int lim){
        // cerr << u << " " << tr[u].l << " " << tr[u].r << " " << x << " " << arr[x] << " " << lim << " sbbs\n";
        while (!v(u).empty()){
            pii t = v(u).back(); v(u).pop_back();
            if (vis[t.snd]) continue;
            if (t.fst >= arr[x]){
                if (t.fst <= lim) ans[t.snd] = arr[x],vis[t.snd] = true;
                else{
                    v(u).push_back(t); break;
                }
            }
            // cerr << u << " " << x << " " << arr[x] << " " << lim << " " << t.fst << " " << t.snd << " ???\n";
        }
        if (tr[u].l == tr[u].r) return;
        int mid = tr[u].l + tr[u].r >> 1;
        if (x <= mid) update(ls(u),x,lim);
        else update(rs(u),x,lim);
    }

    #undef ls
    #undef rs
    #undef v
}T;

int main(){
    memset(ans,-1,sizeof(ans));
    n = read(); scanf("%s",s + 1); init(n);
    m = read(); T.build(1,1,m);
    for (re int i = 1;i <= m;i++){
        arr[i] = read();
        int l = arr[i],r = n;
        // cerr << arr[i] << " begin:\n";
        while (l < r){
            int mid = l + r + 1 >> 1;
            int len = mid - arr[i];
            // cerr << mid << " " << len << " " << get(L[mid],L[mid] + len - 1) << " " << get(R[mid] - len + 1,R[mid]) << " ???\n";
            if (get(L[mid],L[mid] + len - 1) == get(R[mid] - len + 1,R[mid])) l = mid;
            else r = mid - 1;
        }
        lim[i] = {i,l};
        // cerr << arr[lim[i].fst] << " " << lim[i].snd << " !!!\n";
    }
    // return 0;
    q = read();
    for (re int i = 1,k,l,r;i <= q;i++){
        k = read(),l = read(),r = read();
        Q[i] = {k,l,r,i};
    }
    sort(Q + 1,Q + q + 1);
    sort(lim + 1,lim + m + 1,[](const pii &a,const pii &b){
        return arr[a.fst] < arr[b.fst];
    });
    // cerr << "====\n"; return 0;
    for (re int i = 1;i <= q;i++) T.modify(1,Q[i].l,Q[i].r,{Q[i].k,Q[i].id});
    for (re int i = 1;i <= m;i++) T.update(1,lim[i].fst,lim[i].snd);
    for (re int i = 1;i <= q;i++) printf("%d\n",ans[i]);
    return 0;
}