// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rrep(i, n) for (int i = (int)n-1; i >= 0; --i)
using namespace std;
using ll = long long;
template<typename T>
inline bool chmax(T& a, const T& b) {
    if (a < b){
        a = b;
        return true;
    }
    return false;
}
template<typename T>
inline bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/**
 * @brief 多次元 vector の作成
 * @author えびちゃん
 */
namespace detail {
    template<typename T, int N>
    auto make_vec(vector<int>& sizes, T const& x) {
        if constexpr (N == 1) {
            return vector(sizes[0], x);
        } else {
            int size = sizes[N-1];
            sizes.pop_back();
            return vector(size, make_vec<T, N-1>(sizes, x));
        }
    }
}
template<typename T, int N>
auto make_vec(int const(&sizes)[N], T const& x = T()) {
    vector<int> s(N);
    for (int i = 0; i < N; ++i) s[i] = sizes[N-i-1];
    return detail::make_vec<T, N>(s, x);
}
__attribute__((constructor))
void fast_io() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

vector<int> x;
multiset<int> s;

struct mo {
    int n, q, width;
    vector<int> ql, qr, qi;
    int ptr = 0, nl = 0, nr = 0;

    mo(int n, int q) : n(n), q(q), width(n / sqrt(q)), ql(q), qr(q), qi(q) {}

    // [l, r)
    inline void insert(int l, int r) { ql[ptr] = l; qr[ptr] = r; ptr++; }

    void build() {
        ptr = 0;
        iota(qi.begin(), qi.end(), 0);
        sort(qi.begin(), qi.end(), [&](int i, int j) {
            if (ql[i] / width != ql[j] / width) return ql[i] < ql[j];
            else {
                if ((ql[i] / width) % 2 == 0) return qr[i] < qr[j];
                else return qr[i] > qr[j];
            }
        });
    }

    inline int process() {
        int i = qi[ptr++];
        while (ql[i] < nl) add(--nl);
        while (nr < qr[i]) add(nr++);
        while (nl < ql[i]) del(nl++);
        while (qr[i] < nr) del(--nr);
        return i;
    }

    inline void add(int i) { s.insert(x[i]); };
    inline void del(int i) { s.erase(s.find(x[i])); };
};

int main() {
    int n;
    cin >> n;
    x.resize(n);
    rep(i, n) cin >> x[i];
    int q;
    cin >> q;
    mo solver(n, q);
    vector<int> query(q);
    rep(i, q) {
        int l, r;
        cin >> l >> r >> query[i];
        l--; r--;
        solver.insert(l, r + 1);
    }
    solver.build();
    vector<int> ans(q, INT_MAX);
    rep(i, q) {
        int id = solver.process();
        auto it = s.lower_bound(query[id]);
        if (it == s.begin()) {
            chmin(ans[id], *it - query[id]);
        } else {
            if (it != s.end()) chmin(ans[id], *it - query[id]);
            it--;
            chmin(ans[id], query[id] - *it);
        }
    }
    rep(i, q) cout << ans[i] << '\n';
}