#include <bits/stdc++.h>
#include <atcoder/segtree>
using namespace std;
using namespace atcoder;
#define int long long

struct Query {
    int value, left, right, index;
    bool operator<(const Query& other) const {
        return value < other.value;
    }
};

int inf=1ll<<60;

int op(int a, int b) {
    return max(a, b);
}

int e() {
    return -inf;  // effectively negative infinity
}


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N;
    cin >> N;
    vector<int> X(N);
    for (int i = 0; i < N; ++i) {
        cin >> X[i];
    }

    int Q;
    cin >> Q;
    vector<Query> query0, query1;
    vector<int> ans(Q, inf);
    for (int i = 0; i < N; ++i) {
        query0.push_back({X[i], -1, -1, i});
        query1.push_back({-X[i], -1, -1, i});
    }
    for (int i = 0; i < Q; ++i) {
        int l, r, x;
        cin >> l >> r >> x;
        --l;
        query0.push_back({x, l, r, i});
        query1.push_back({-x, l, r, i});
    }

    sort(query0.begin(), query0.end());
    sort(query1.begin(), query1.end());

    for (auto& query : {query0, query1}) {
        segtree<int, op, e> seg(N);
        for (auto& q : query) {
            if (q.left == -1) {
                seg.set(q.index, q.value);
            } else {
                ans[q.index] = min(ans[q.index], q.value - seg.prod(q.left, q.right));
            }
        }
    }

    for (int i = 0; i < Q; ++i) {
        cout << ans[i] << "\n";
    }

    return 0;
}