#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N;
    cin >> N;
    vector<ll> X(N);
    rep(i, N) cin >> X[i];

    int K = 0;
    while(K*K < 20*N) K++;
    vector<vector<ll>> Xs(N/K+1);
    rep(i, N){
        Xs[i/K].eb(X[i]);
    }
    each(e, Xs){
        e.eb(-INF), e.eb(INF);
        sort(all(e));
    }

    int Q;
    cin >> Q;
    while(Q--){
        int L, R; ll x;
        cin >> L >> R >> x; L--;
        ll ans = INF;
        while(L%K != 0 && L < R){
            chmin(ans, abs(X[L]-x));
            L++;
        }
        while(R%K != 0 && L < R){
            chmin(ans, abs(X[R-1]-x));
            R--;
        }
        while(L < R){
            int i = L/K;
            auto it = lower_bound(all(Xs[i]), x);
            chmin(ans, *it-x);
            it--;
            chmin(ans, x-*it);
            L += K;
        }
        cout << ans << '\n';
    }
}