class SegmentTree:
    def __init__(self, init_val, segfunc, ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1

    def query(self, l, r):
        res = self.ide_ele

        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res

import sys

input = sys.stdin.readline

N = int(input())
X = list(map(int,input().split()))
Q = int(input())
query = []
for _ in range(Q):
    l,r,x = map(int,input().split())
    query.append((l-1,r,x,_))

query.sort(key=lambda x:x[2])
ans = [0 for i in range(Q)]

Seg_lower = SegmentTree([-10**15 for i in range(N)],max,-10**15)
Seg_upper = SegmentTree([X[i] for i in range(N)],min,10**15)

val = [(X[i],i) for i in range(N)]
val.sort(key=lambda x:-x[0])

for l,r,x,idx in query:
    while val and val[-1][0] <= x:
        Seg_lower.update(val[-1][1],val[-1][0])
        Seg_upper.update(val[-1][1],10**15)
        val.pop()

    lower_tmp = x - Seg_lower.query(l,r)
    upper_tmp = Seg_upper.query(l,r) - x
    ans[idx] = min(lower_tmp,upper_tmp)
    #print(lower_tmp,upper_tmp)

print(*ans,sep="\n")