#pragma GCC optimize("O3") 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma") 
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") 
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
 
using namespace std;

int sq;

struct Query {
    int idx, l, r, val;
    int V;
    int ans;
    Query(int ii, int ll, int rr,int vv) :idx(ii), l(ll), r(rr), val(vv), V(l / sq) {}
};

int N, M;
int arr[300010];
set <int> S;

int main(void) 
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> N;
    vector <int> v(N + 1);

    sq = (int)sqrt(N);

    for (int n = 0; n < N; n++)
    {
        cin >> arr[n];
    }

    vector<Query> save;
    cin >> M;
    for (int m = 0; m < M; m++) 
    {
        int u, v, x;

        cin >> u >> v >> x;
        u--;
        v--;
        save.emplace_back(Query(m, u, v, x));

    }

    sort(save.begin(), save.end(), [&](Query const& a, Query const& b)->bool {
        if (a.V == b.V) return a.r < b.r;
        return a.V < b.V;
        });


    int L = save[0].l, R = save[0].l - 1;

    for (int m = 0; m < M; m++) {

        while (L < save[m].l) 
        {
            S.erase(arr[L]);
            L++;
        }

        while (L > save[m].l) 
        {
            L--;
            S.insert(arr[L]);
        }

        while (R < save[m].r) 
        {
            R++;
            S.insert(arr[R]);
        }

        while (R > save[m].r) 
        {
            S.erase(arr[R]);
            R--;
        }

		int X = save[m].val;
		auto it = S.lower_bound(X);
		int res = 1e9;
		if(it!=S.end())
		{
			int d = *it - X;
			res = min(res,d);
		}
		if(it!=S.begin())
		{
			it--;
			int d = X - *it;
			res = min(res,d);
		}
        save[m].ans = res;
    }

    sort(save.begin(), save.end(), [&](Query const& a, Query const& b)->bool 
    {
        return a.idx < b.idx;
    });

    for (int m = 0; m < M; m++)
    {
        cout << save[m].ans << '\n';
    }

    return 0;

}