#include <bits/stdc++.h>

// #define int long long
#define ll long long
#define ull unsigned long long
#define db double
#define ld long double
#define rep(i,l,r) for (int i = (int)(l); i <= (int)(r); ++ i )
#define rep1(i,l,r) for (int i = (int)(l); i >= (int)(r); -- i )
#define il inline
#define fst first
#define snd second
#define ptc putchar
#define Yes ptc('Y'),ptc('e'),ptc('s'),puts("")
#define No ptc('N'),ptc('o'),puts("")
#define YES ptc('Y'),ptc('E'),ptc('S'),puts("")
#define NO ptc('N'),ptc('O'),puts("")
#define pb emplace_back
#define sz(x) (int)(x.size())
#define all(x) x.begin(),x.end()
#define get(x) ((x - 1) / len + 1)
#define debug() puts("------------")

using namespace std;
typedef pair<int,int> PII;
typedef pair<int,PII> PIII;
typedef pair<ll,ll> PLL;
namespace szhqwq {
    template<class T> il void read(T &x) {
        x = 0; T f = 1; char ch = getchar();
        while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
        while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
        x *= f;
    }
    template<class T,class... Args> il void read(T &x,Args &...x_) { read(x); read(x_...); }
    template<class T> il void print(T x) {
        if (x < 0) ptc('-'), x = -x; 
        if (x > 9) print(x / 10); ptc(x % 10 + '0');
    }
    template<class T,class T_> il void write(T x,T_ ch) { print(x); ptc(ch); }
    template<class T,class T_> il void chmax(T &x,T_ y) { x = max(x,y); }
    template<class T,class T_> il void chmin(T &x,T_ y) { x = min(x,y); }
    template<class T,class T_,class T__> il T qmi(T a,T_ b,T__ p) {
        T res = 1; while (b) {
            if (b & 1) res = res * a % p;
            a = a * a % p; b >>= 1;
        } return res;
    }
    template<class T> il T gcd(T a,T b) { if (!b) return a; return gcd(b,a % b); }
    template<class T,class T_> il void exgcd(T a, T b, T_ &x, T_ &y) {
        if (b == 0) { x = 1; y = 0; return; }
        exgcd(b,a % b,y,x); y -= a / b * x; return ;
    }
    template<class T,class T_> il T getinv(T x,T_ p) { T inv,y; exgcd(x,(T)p,inv,y); inv = (inv + p) % p; return inv; }
} using namespace szhqwq;
const int N = 1e6 + 10,inf = 1e9,mod = 998244353;
const ull base = 131,base_ = 233;
const ll inff = 1e18;
int n,m,q,p[N],L[N],R[N],hh,tt,rt,tot; char qu[N];
ull hsh[N],fac[N]; struct Q { int l,r,id; };
struct node { int l,r,mn; } tr[N << 1];
vector<Q> v[N]; string s; int f[N],pos[N];
vector<int> v_[N]; int ret[N];

il void pushup(int u) {
    tr[u].mn = min(tr[u << 1].mn,tr[u << 1 | 1].mn);
}

il void build(int u,int l,int r) {
    tr[u] = {l,r,inf};
    if (l == r) return ;
    int mid = l + r >> 1;
    build(u << 1,l,mid),build(u << 1 | 1,mid + 1,r);
    return ;
}

il void modify(int u,int x,int k) {
    if (tr[u].l == tr[u].r) {
        tr[u].mn = k;
        return ;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    if (x <= mid) modify(u << 1,x,k);
    else modify(u << 1 | 1,x,k);
    pushup(u);
    return ;
}

il int query(int u,int l,int r) {
    if (l <= tr[u].l && tr[u].r <= r) return tr[u].mn;
    int ret = inf;
    int mid = tr[u].l + tr[u].r >> 1;
    if (l <= mid) chmin(ret,query(u << 1,l,r));
    if (mid < r) chmin(ret,query(u << 1 | 1,l,r));
    return ret;
}

il ull gethsh(int l,int r) {
    return hsh[r] - hsh[l - 1] * fac[r - l + 1];
}

il int check(int val) {
    int l = val,r = n,ret = 0;
    while (l <= r) {
        int mid = l + r >> 1;
        int len = R[mid] - L[mid] + 1; len -= val;
        // if (val == 3) cerr << len << " " << L[mid] << " " << R[mid] << '\n';
        ull x = gethsh(L[mid],L[mid] + len - 1),y = gethsh(R[mid] - len + 1,R[mid]);
        // if (len == 3 && val == 3) cerr << x << " " << y << '\n';
        if (x == y) l = mid + 1,ret = mid;
        else r = mid - 1;
    }
    return ret;
}

il bool cmp(int x,int y) {
    return f[x] < f[y];
}

il void solve() {
    //------------code------------
    read(n); cin >> s; read(m); s = " " + s;
    fac[0] = 1;
    rep(i,1,n * 2 + 1) fac[i] = fac[i - 1] * base;
    hh = n + 1,tt = n;
    rep(i,1,n) {
        if (s[i] >= 'a' && s[i] <= 'z') qu[-- hh] = s[i];
        else if (s[i] >= 'A' && s[i] <= 'Z') qu[++ tt] = s[i] - 'A' + 'a';
        L[i] = hh; R[i] = tt;
    }
    rep(i,hh,tt) hsh[i] = hsh[i - 1] * base + (ull)qu[i];
    rep(i,1,m) read(p[i]),v_[p[i]].pb(i);
    rep(i,1,n) f[i] = check(i),pos[i] = i;
    // rep(i,1,n) cerr << f[i] << " "; cerr << '\n';
    sort(pos + 1,pos + n + 1,cmp);
    build(1,1,m);
    read(q); 
    rep(i,1,q) {
        int l,r,k; read(k,l,r);
        v[k].pb((Q){l,r,i});
    }
    int pp = n;
    rep1(i,n,1) {
        while (pp >= 1 && f[pos[pp]] >= i) {
            for (auto x : v_[pos[pp]]) modify(1,x,pos[pp]);
            -- pp;
        }
        for (auto x : v[i]) {
            int val = query(1,x.l,x.r);
            if (val > i) val = -1;
            ret[x.id] = val;
        }
    }
    rep(i,1,q) write(ret[i],'\n');
    return ;
}

il void init() {
    return ;
}

signed main() {
    // init();
    int _ = 1;
    // read(_);
    while (_ -- ) solve();
    return 0;
}