#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>

using namespace std;

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) os << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; }

template <typename T> void print(T a, int n, const string& split = " ") { for (int i = 0; i < n; i++) { cout << a[i]; if (i + 1 != n) cout << split; } cout << endl; }
template <typename T> void print2d(T a, int w, int h, int width = -1, int br = 0) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
template <typename T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
#define dump(v) (cerr << #v << ": " << v << endl)

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define clr(a, x) memset(a, x, sizeof(a))
#define sz(a) ((int)(a).size())
#define mp(a, b) make_pair(a, b)
#define ten(n) ((long long)(1e##n))

template <typename T, typename U> void upmin(T& a, const U& b) { a = min<T>(a, b); }
template <typename T, typename U> void upmax(T& a, const U& b) { a = max<T>(a, b); }
template <typename T> void uniq(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); }
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }

typedef long long ll;
typedef pair<int, int> pint;

const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };


const ll inf = ten(9);
class SegTree
{
private:
    vector<vector<ll>> data;
    int n;
 
    ll _query(int a, int b, int k, int l, int r, ll d)
    {
        if (r <= a || b <= l)
            return inf;
 
        if (a <= l && r <= b)
        {
            auto it = upper_bound(all(data[k]), d);
            ll diff = inf;
            ll x = *it - d;
            ll y = d - *--it;
            assert(x >= 0);
            assert(y >= 0);
            return min(x, y);
        }
        else
        {
            ll left = _query(a, b, 2 * k + 1, l, (l + r) / 2, d);
            ll right = _query(a, b, 2 * k + 2, (l + r) / 2, r, d);
            return min(left, right);
        }
    }

    void update(int k, ll v)
    {
        k += n - 1;
        data[k].push_back(v);
        while (k > 0)
        {
            k = (k - 1) / 2;
            data[k].push_back(v);
        }
    }
public:
 
    SegTree(const vector<ll>& a)
    {
        int n = a.size();
        this->n = 1;
        while (this->n < n)
            this->n *= 2;
        data = vector<vector<ll>>(this->n * 2, {-inf, inf});

        rep(i, n)
            update(i, a[i]);

        for (auto& v : data)
        {
//             dump(v);
            sort(all(v));
        }
    }

    ll query(int a, int b, ll d) { return _query(a, b, 0, 0, n, d); }
};
int main()
{
    int n;
    scanf("%d", &n);
    vector<ll> a(n);
    rep(i, n)
        scanf("%lld", &a[i]);

    SegTree seg(a);

    int q;
    scanf("%d", &q);
    rep(qi, q)
    {
        int l, r, d;
        scanf("%d%d%d", &l, &r, &d);

        ll diff = seg.query(l, r + 1, d);
        assert(diff < ten(8));
        cout << diff << endl;
    }
}


Measured memory_bytes: 37924