#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
using mint = modint998244353;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1010101010;
int B;
set<int> S;

struct query
{
    int l;
    int r;
    int x;
    int ind;
};

bool comp(query &a, query &b)
{
    int ra = a.r / B;
    int rb = b.r / B;
    if (ra != rb)
    {
        return ra < rb;
    }
    return a.l < b.l;
}

void add(int i, vector<int> &A)
{
    S.insert(A[i]);
    return;
}

void del(int i, vector<int> &A)
{
    S.erase(A[i]);
    return;
}

int main()
{
    int N;
    cin >> N;
    vector<int> X(N);

    rep(i, N)
    {
        cin >> X[i];
    }
    int Q;
    cin >> Q;
    B = ceil(sqrt(N));
    vector<query> Data(Q);
    rep(i, Q)
    {
        int l, r, x;
        cin >> l >> r >> x;
        l--, r--;
        Data[i].l = l;
        Data[i].r = r;
        Data[i].x = x;
        Data[i].ind = i;
    }
    sort(Data.begin(), Data.end(), comp);
    vector<int> ans(Q);
    int now_l = 0, now_r = 0;
    S.insert(inf);
    S.insert(-inf);
    S.insert(X[0]);
    for (int i = 0; i < Q; i++)
    {
        int l = Data[i].l, r = Data[i].r, x = Data[i].x, ind = Data[i].ind;
        while (r > now_r)
        {
            add(now_r + 1, X);
            now_r++;
        }
        while (r < now_r)
        {
            del(now_r, X);
            now_r--;
        }
        while (l > now_l)
        {
            del(now_l, X);
            now_l++;
        }
        while (l < now_l)
        {
            add(now_l - 1, X);
            now_l--;
        }
        auto iter = S.lower_bound(x);
        int val = *iter - x;
        iter--;
        val = min(val, x - *iter);        
        ans[ind] = val;
    }
    rep(i, Q)
    {
        printf("%d\n", ans[i]);
    }
}