#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define fir first
#define sec second
typedef vector <int> vi;
typedef vector <ll> vl;

#ifdef LCX
#define msg(args...) fprintf(stderr, args)
#else
#define msg(...) void()
#endif

const int maxn = 5e5 + 10, inf = 1e9;
int n, m, q, p[maxn], a[maxn];
char d[maxn], s[maxn];
pii f[maxn];

template <int B, int M>
struct Hash {
    int hs[maxn], pw[maxn];
    void build() {
        pw[0] = 1;
        for (int i = 1; i <= n; ++i)
            hs[i] = ((ll) hs[i - 1] * B + s[i] - 'a' + 1) % M,
            pw[i] = (ll) pw[i - 1] * B % M;
    }
    int ask(int l, int r) {
        return (hs[r] - (ll) hs[l - 1] * pw[r - l + 1] % M + M) % M;
    }
};
Hash <131, 998244353> h1;
Hash <13331, 1000000007> h2;
int sam(int l1, int r1, int l2, int r2) {
    if (r1 - l1 + 1 != r2 - l2 + 1) return 0;
    return h1.ask(l1, r1) == h1.ask(l2, r2) &&
            h2.ask(l1, r1) == h2.ask(l2, r2);
}

int check(int l, int r, int len) {
    if (len >= r - l + 1) return 1;
    len = r - l + 1 - len;
    return sam(l, l + len - 1, r - len + 1, r);
}

struct Query {
    int k, l, r, ans;
} b[maxn];
vi va[maxn], vq[maxn];
struct SegTree {
    int mn[maxn << 2], N;
    void push_up(int o) { mn[o] = min(mn[o << 1], mn[o << 1 | 1]); }
    void build() {
        for (N = 1; N <= m + 4; N <<= 1);
        fill(mn + 1, mn + (N << 1), inf);
    }
    void update(int p, int val) {
        p += N, mn[p] = val;
        for (p >>= 1; p; p >>= 1) push_up(p);
    }
    int ask(int l, int r) {
        int res = inf;
        l += N - 1, r += N + 1;
        for (; l ^ r ^ 1; l >>= 1, r >>= 1) {
            if (~l & 1) res = min(res, mn[l ^ 1]);
            if (r & 1) res = min(res, mn[r ^ 1]);
        }
        return res;
    }
} tr;

int main() {
    scanf("%d%s%d", &n, d + 1, &m);
    {
        int l = 1;
        for (int i = 1; i <= n; ++i) l += ('a' <= d[i] && d[i] <= 'z');
        int r = l - 1;
        msg("%d %d\n", l, r);
        for (int i = 1; i <= n; ++i) {
            if ('a' <= d[i] && d[i] <= 'z') s[--l] = d[i];
            else s[++r] = d[i] - 'A' + 'a';
            f[i] = {l, r};
        }
    }
    // printf("%s\n", s + 1);
    h1.build(), h2.build();
    for (int i = 1; i <= n; ++i) {
        int l = 1, r = n, res = 0;
        while (l <= r) {
            int mid = (l + r) >> 1;
            if (check(f[mid].fir, f[mid].sec, i))
                res = mid, l = mid + 1;
            else r = mid - 1;
        }
        a[i] = res;
        // msg("%d : %d\n", i, a[i]);
    }
    for (int i = 1; i <= m; ++i)
        scanf("%d", &p[i]),
        va[p[i] - 1].push_back(-i),
        va[a[p[i]]].push_back(i);
    scanf("%d", &q);
    for (int i = 1; i <= q; ++i)
        scanf("%d%d%d", &b[i].k, &b[i].l, &b[i].r),
        vq[b[i].k].push_back(i);
    tr.build();
    for (int i = n; i >= 1; --i) {
        for (int o : va[i])
            tr.update(abs(o), o > 0 ? p[o] : inf);
        for (int o : vq[i])
            b[o].ans = tr.ask(b[o].l, b[o].r);
    }
    for (int i = 1; i <= q; ++i)
        printf("%d\n", b[i].ans <= n ? b[i].ans : -1);
    return 0;
}