## https://yukicoder.me/problems/no/1332

MAX_INT = 10 ** 18

class SegmentTree:
    """
    非再帰版セグメント木。
    更新は「加法」、取得は「最大値」のもの限定。
    """

    def __init__(self, init_array):
        n = 1
        while n < len(init_array):
            n *= 2
        
        self.size = n
        self.array = [[] for _ in range(2 * self.size)]
        for i, a in enumerate(init_array):
            self.array[self.size + i].append(a)
        
        end_index = self.size
        start_index = end_index // 2
        while start_index >= 1:
            for i in range(start_index, end_index):
                self._op(self.array[i], self.array[2 * i], self.array[2 * i + 1])
            end_index = start_index
            start_index = end_index // 2
    
    def _op(self, array, left, right):
        left_index = 0
        right_index = 0
        l = len(left)
        r = len(right)
        for _ in range(l + r):
            if left_index == l:
                array.append(right[right_index])
                right_index += 1
            elif right_index == r:
                array.append(left[left_index])
                left_index += 1
            else:
                if left[left_index] <= right[right_index]:
                    array.append(left[left_index])
                    left_index += 1
                else:
                    array.append(right[right_index])
                    right_index += 1

    def calc(self, array, x):
        if len(array) == 0:
            return MAX_INT
        if x <= array[0]:
            return array[0] - x
        elif x >= array[-1]:
            return x - array[-1]
        
        low = 0
        high = len(array) - 1
        while high - low > 1:
            mid = (high + low) //2
            if array[mid] <= x:
                low = mid
            else:
                high = mid
        if array[high] <= x:
            return min(x - array[high], array[high + 1] - x)
        else:
            return min(x - array[low], array[low + 1] - x)

    def get_abs_min(self, l, r, x):
        L = self.size + l; R = self.size + r

        # 2. 区間[l, r)の最大値を求める
        s = MAX_INT
        while L < R:
            if R & 1:
                R -= 1
                s = min(s, self.calc(self.array[R], x))
            if L & 1:
                s = min(s, self.calc(self.array[L], x))
                L += 1
            L >>= 1; R >>= 1
        return s


def main():
    N = int(input())
    X = list(map(int, input().split()))
    Q = int(input())
    lrx = []
    for _ in range(Q):
        l, r, x = map(int, input().split())
        lrx.append((l - 1 ,r - 1, x))
    
    seg_tree = SegmentTree(X)
    for l, r, x in lrx:
        ans = seg_tree.get_abs_min(l, r + 1, x)
        print(ans)






if __name__ == '__main__':
    main()