#include <bits/stdc++.h>
using namespace std;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }

constexpr int B = 400;

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> X(N);
    for (auto &x : X) cin >> x;
    int K = (N + B - 1) / B;
    vector<vector<int>> segs(K);
    REP(i, N) segs[i / B].push_back(X[i]);

    for (auto &vec : segs) sort(vec.begin(), vec.end());

    int Q;
    cin >> Q;
    while (Q--) {
        int l, r, x;
        cin >> l >> r >> x;
        l--;
        int ret = 1 << 30;
        while (l % B and l < r) {
            chmin(ret, abs(x - X[l]));
            l++;
        }
        while (r % B and r > l) {
            r--;
            chmin(ret, abs(x - X[r]));
        }
        for (int ib = l / B, ie = r / B; ib < ie; ib++) {
            auto itr = lower_bound(segs[ib].begin(), segs[ib].end(), x);
            if (itr != segs[ib].end()) chmin(ret, abs(x - *itr));
            if (itr != segs[ib].begin()) chmin(ret, abs(x - *(--itr)));
        }
        cout << ret << '\n';
    }
}