#include <bits/stdc++.h>

using namespace std;

const int INF = 1<<30;
vector<int> t[6000000];

void build(const vector<int> &x, int k, int l, int r) {
  if (l < r) {
    if (l + 1 == r) {
      t[k].push_back(x[l]);
    } else {
      int m = (l + r) / 2;
      build(x, 2 * k + 1, l, m);
      build(x, 2 * k + 2, m, r);
      merge(t[2*k+1].begin(), t[2*k+1].end(),
            t[2*k+2].begin(), t[2*k+2].end(), back_inserter(t[k]));
    }
  }
}

int query(int k, int l, int r, int a, int b, int y) {
  if (b <= l || r <= a) return INF;
  if (a <= l && r <= b) {
    int ret = INF;
    int pos = lower_bound(t[k].begin(), t[k].end(), y) - t[k].begin();
    if (pos < t[k].size())
      ret = min(ret, abs(t[k][pos] - y));
    if (--pos >= 0)
      ret = min(ret, abs(t[k][pos] - y));
    return ret;
  }
  int mi = (l + r) / 2;
  return min(query(2 * k + 1, l, mi, a, b, y), query(2 * k + 2, mi, r, a, b, y));
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  vector<int> x(n);
  for (int i = 0; i < n; i++)
    cin >> x[i];

  build(x, 0, 0, n);
  
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int l, r, y;
    cin >> l >> r >> y;
    --l;
    cout << query(0, 0, n, l, r, y) << endl;
  }
  
  return 0;
}