#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
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;}
#define rep(i,n) for(int i=0;i<(n);i++)
#define drep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define debug(x)  cerr << #x << " = " << (x) << endl;

constexpr int si = 600;
constexpr int inf = 1e9;

class SqrtDecomposition{
private:

    class bucket{
        vec<int> val;
        vec<int> s;
        int N,l,r;

        bool invalid(int a,int b){
            return max(l,a)>min(b,r);
        }


        int query_all(int x){
            int res = inf;
            int id = lower_bound(all(s),x)-s.begin();
            if(id!=N) chmin(res,abs(x-s[id]));
            if(id!=0) chmin(res,abs(x-s[id-1]));
            return res;
        }

        int query_partial(int a,int b,int x){
            int res = inf;
            for(int i=a;i<b;i++) chmin(res,abs(x-val[i]));
            return res;
        }

    public:
        bucket(int l,int r,vec<int>& A):N(r-l),l(l),r(r),val(A),s(A){
            sort(all(s));
        }

        int query(int a,int b,int x){
            if(invalid(a,b)) return inf;
            if(a<=l && r<=b) return query_all(x);
            else return query_partial(max(l,a)-l,min(r,b)-l,x);
        }
    };

    int N;
    vec<bucket> B;

public:
    SqrtDecomposition(int N,vec<int> A):N(N){
        for(int l=0;l<N;l+=si){
            int r = min(N,si+l);
            vec<int> val;
            for(int i=l;i<r;i++) val.push_back(A[i]);
            bucket b(l,r,val);
            B.push_back(b);
        }
    }

    int query(int l,int r,int x){
        int res = inf;
        for(auto& b:B) chmin(res,b.query(l,r,x));
        return res;
    }

};


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vec<int> X(N);
    rep(i,N) cin >> X[i];
    SqrtDecomposition D(N,X);
    int Q;
    cin >> Q;
    rep(_,Q){
        int l,r,x;
        cin >> l >> r >> x;
        l--,r--;
        cout << D.query(l,r+1,x) << "\n";
    }
}