#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

#include <functional>
#include <climits>

//SegmentTree<int> seg(N,[](int a,int b){return min(a,b);},INT_MAX);
template< typename T>
class SegmentTree{
private:
  void resize(int size){
      n=1;
      while(n<size) n*=2;
      tree.resize(2*n-1,def);
  }
public:

  using F = function<T(T,T)>;

  int n;
  vector<T> tree;
  F operation;
  T def;

  SegmentTree(){}
  SegmentTree(int size,F _operation,T _def):operation(_operation),def(_def){
    resize(size);
  }

  void embody(int size,F _operation,T _def){
    operation=_operation;
    def=_def;
    resize(size);
  }

  void initialize(const vector<T> &v){
    int size=v.size();
    resize(size);

    for(int i=0;i<size;i++) tree[i+n-1]=v[i];
    for(int i=n-2;i>=0;i--) tree[i]=operation(tree[2*i+1],tree[2*i+2]);
  }

  void update(int index,T value){
    index+=n-1;

    tree[index]=value;
    while(index>0){
      index=(index-1)/2;
      tree[index]=operation(tree[2*index+1],tree[2*index+2]);
    }
  }

  T query(int a,int b,int k=0,int l=0,int r=-1){//[a,b)
    if(r<0) r=n;

    if(r<=a||b<=l) return def;
    else if(a<=l&&r<=b) return tree[k];
    else{
      T lval=query(a,b,2*k+1,l,(l+r)/2);
      T rval=query(a,b,2*k+2,(l+r)/2,r);
      return operation(lval,rval);
    }
  }

  T get(int index){
      return tree[index+n-1];
  }

  int find(int x,int k=0,int l=0,int r=-1){// a[0]+...+a[i]>=x (i:minimal)
    if(r<0) r=n;
    if(tree[k]<x) return -1;
    if(r-l==1) return k-(n-1);
    if(tree[2*k+1]>=x) return find(x,2*k+1,l,(l+r)/2);
    else return find(x-tree[2*k+1],2*k+2,(l+r)/2,r);
  }

  //right -> change vl to vr   (notice doesn't contain b. range [a,b))
  int find_left(int a,int b,T x,int k=0,int l=0,int r=-1){// min(a[a],...,a[i])<=x (i:minimal)
      if(r<0) r=n;
      if(tree[k]>x||r<=a||b<=l) return -1;
      if(r-l==1) return k-(n-1);
      int vl=find_left(a,b,x,2*k+1,l,(l+r)/2);
      if(vl>=0) return vl;
      return find_left(a,b,x,2*k+2,(l+r)/2,r);
  }

  int find_right(int a,int b,T x,int k=0,int l=0,int r=-1){// min(a[i],...,a[b-1])<=x (i:minimal)
      if(r<0) r=n;
      if(tree[k]>x||r<=a||b<=l) return -1;
      if(r-l==1) return k-(n-1);
      int vr=find_right(a,b,x,2*k+2,(l+r)/2,r);
      if(vr>=0) return vr;
      return find_right(a,b,x,2*k+1,l,(l+r)/2);
  }
};

const ll INF=1e18;

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

  int N;
  cin>>N;
  vector<ll> X(N);
  rep(i,N) cin>>X[i];
  int Q;
  cin>>Q;
  vector<int> L(Q),R(N);
  vector<ll> Z(Q);
  rep(i,Q) cin>>L[i]>>R[i]>>Z[i];

  rep(i,Q){
    L[i]--;R[i]--;
  }

  vector<vector<int>> qrys(N);
  for(int i=0;i<Q;i++) qrys[L[i]].push_back(i);

  vector<ll> v=X;
  rep(i,Q) v.push_back(Z[i]);
  sort(all(v));
  v.erase(unique(all(v)),v.end());
  int V=v.size();
  map<ll,int> mp;
  rep(i,V) mp[v[i]]=i;

  SegmentTree<int> seg(V,[](int a,int b){
    return min(a,b);
  },N+1);
  seg.initialize(vector<int> (V,N+1));

  vector<ll> ans(Q,INF);
  for(int left=N-1;left>=0;left--){
    seg.update(mp[X[left]],left);
    for(auto i:qrys[left]){
      int l=L[i];
      int r=R[i];
      int z=Z[i];

      int lid=seg.find_right(0,mp[z],r);
      int rid=seg.find_left(mp[z],V,r);
      if(lid!=-1) chmin(ans[i],abs(z-v[lid]));
      if(rid!=-1) chmin(ans[i],abs(z-v[rid]));
    }
  }

  rep(i,Q) cout<<ans[i]<<"\n";


  return 0;
}