/* -*- coding: utf-8 -*-
 *
 * 1332.cc:  No.1332 Range Nearest Query - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 300000;
const int MAX_E2 = 1 << 20; // = 1048576
const int MAX_QN = 100000;
const int INF = 1 << 30;

/* typedef */

template <typename T, const int MAX_E2>
struct SegTreeMax {
  int e2;
  T nodes[MAX_E2];
  SegTreeMax() {}

  void init(int n) {
    for (e2 = 1; e2 < n; e2 <<= 1);
    memset(nodes, -1, sizeof(nodes));
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  //void set(int i, T v) { get(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
  }

  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    while (j > 0) {
      j = (j - 1) / 2;
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
    }
  }

  int min_index(int li, T v, int k, int i0, int i1) {
    if (nodes[k] < v || i1 <= li) return i1;
    if (i0 + 1 >= i1) return i0;

    int im = (i0 + i1) / 2;
    int idx0 = min_index(li, v, k * 2 + 1, i0, im);
    if (idx0 < im) return idx0;
    int idx1 = min_index(li, v, k * 2 + 2, im, i1);
    return idx1;
  }
  int min_index(int li, T v) { return min_index(li, v, 0, 0, e2); }

  int max_index(int ri, T v, int k, int i0, int i1) {
    if (nodes[k] < v || ri <= i0) return i0 - 1;
    if (i0 + 1 >= i1) return i0;

    int im = (i0 + i1) / 2;
    int idx1 = max_index(ri, v, k * 2 + 2, im, i1);
    if (idx1 >= im) return idx1;
    int idx0 = max_index(ri, v, k * 2 + 1, i0, im);
    return idx0;
  }
  int max_index(int ri, T v) { return max_index(ri, v, 0, 0, e2); }
};

struct Query {
  int li, xi, i;
  Query() {}
  Query(int _li, int _xi, int _i): li(_li), xi(_xi), i(_i) {}
};

typedef vector<Query> vq;

/* global variables */

int xs[MAX_N], uxs[MAX_N], as[MAX_QN];
vq qs[MAX_N];
SegTreeMax<int,MAX_E2> st;

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) scanf("%d", xs + i), uxs[i] = xs[i];
  sort(uxs, uxs + n);
  int m = unique(uxs, uxs + n) - uxs;

  int qn;
  scanf("%d", &qn);

  for (int i = 0; i < qn; i++) {
    int li, ri, xi;
    scanf("%d%d%d", &li, &ri, &xi);
    li--, ri--;
    qs[ri].push_back(Query(li, xi, i));
  }

  st.init(m);

  for (int i = 0; i < n; i++) {
    int xi = lower_bound(uxs, uxs + m, xs[i]) - uxs;
    st.set(xi, i);

    vq &qi = qs[i];
    for (vq::iterator vit = qi.begin(); vit != qi.end(); vit++) {
      Query &q = *vit;
      int xq = lower_bound(uxs, uxs + m, q.xi) - uxs;
      int xi0 = st.min_index(xq, q.li);
      int xi1 = st.max_index(xq, q.li);
      int d = INF;
      if (xi0 < m) d = min(d, uxs[xi0] - q.xi);
      if (xi1 >= 0) d = min(d, q.xi - uxs[xi1]);
      as[q.i] = d;
    }
  }

  for (int i = 0; i < qn; i++) printf("%d\n", as[i]);
  return 0;
}