#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
int X[303030];
int Q;
int L[303030],R[303030],Y[303030],ret[303030];
vector<pair<int,int>> O[2];

template<class V,int NV> class SegTree_1 {
public:
	vector<V> val;
	static V const def=-(1<<30)+5;
	V comp(V l,V r){ return max(l,r);};
	
	SegTree_1(){val=vector<V>(NV*2,def);};
	V getval(int x,int y,int l=0,int r=NV,int k=1) { // x<=i<y
		if(r<=x || y<=l) return def;
		if(x<=l && r<=y) return val[k];
		return comp(getval(x,y,l,(l+r)/2,k*2),getval(x,y,(l+r)/2,r,k*2+1));
	}
	void update(int entry, V v) {
		entry += NV;
		val[entry]=comp(v,val[entry]); //上書きかチェック
		while(entry>1) entry>>=1, val[entry]=comp(val[entry*2],val[entry*2+1]);
	}
};
SegTree_1<int,1<<20> st[2];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>X[i];
		O[0].push_back({X[i],i});
		O[1].push_back({-X[i],i});
	}
	cin>>Q;
	FOR(i,Q) {
		cin>>L[i]>>R[i]>>Y[i];
		L[i]--;
		O[0].push_back({Y[i],N+i});
		O[1].push_back({-Y[i],N+i});
		ret[i]=(1<<30)-3;
	}
	
	FOR(i,2) {
		sort(ALL(O[i]));
		FORR2(v,e,O[i]) {
			if(e<N) {
				st[i].update(e,v);
			}
			else {
				e-=N;
				ret[e]=min(ret[e],v-st[i].getval(L[e],R[e]));
			}
		}
	}
	FOR(i,Q) cout<<ret[i]<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}