//@formatter:off
#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--)
#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    vi X(n);
    cin >> X;
    int q;
    cin >> q;
    vi l(q), r(q), x(q);
    rep(i, q) {
        cin >> l[i] >> r[i] >> x[i];
        l[i]--;
    }
    vi ord(q);
    iota(all(ord), 0);
    int d = (int)sqrt(n) + 1;
    auto cmp = [&](int i, int j) {
        if (l[i] / d != l[j] / d) return l[i] / d < l[j] / d;
        return r[i] < r[j];
    };
    sort(all(ord), cmp);
    multiset<int> st;
    auto add = [&](int i) {
        st.insert(X[i]);
    };
    auto erase = [&](int i) {
        st.erase(st.find(X[i]));
    };
    int nl = 0, nr = 0;
    vi ans(q, inf);
    rep(i, q) {
        int now = ord[i];
        while (nr < r[now]) add(nr++);
        while (nl > l[now]) add(--nl);
        while (nr > r[now]) erase(--nr);
        while (nl < l[now]) erase(nl++);
        auto it = st.lower_bound(x[now]);
        if (it != st.end()) chmin(ans[now], *it - x[now]);
        if (it != st.begin()) {
            it--;
            chmin(ans[now], x[now] - *it);
        }
    }
    for (int i : ans) cout << i << '\n';
}