#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n';
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n';
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int N=100010;
ll gcd(ll a,ll b){
	return !b?a:gcd(b,a%b);
}
int n,q;
ll a[N];
vpll suf[N];
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.in","w",stdout));
	#endif
	read(n,q);
	for(int i=1;i<=n;i++)read(a[i]);
	for(int i=n;i>=1;i--){
		vpll t=suf[i+1];
		t.pb(i,a[i]);
		for(auto &[x,y]:t)y=gcd(y,a[i]);
		for(int j=0;j<(int)t.size();j++)
			if(j==(int)t.size()-1 || t[j].se!=t[j+1].se)
				suf[i].pb(t[j]);
	}
	for(int i=1;i<=n;i++)reverse(suf[i].begin(),suf[i].end());
	while(q--){
		int l,r,k;read(l);read(r);read(k);
		auto query=[&](int l,int r){
			ll s=0;
			for(auto [x,y]:suf[l])
				if(x<=r)s=y;
				else break;
			return s;
		};
		ll ans=0;
		function<void(int,int,ll)>dfs=[&](int x,int ct,ll now){
			if(x>r+1)return ;
			if(x==r+1){
				cmax(ans,now);
				return ;
			}
			if(now&&now<=ans)return ;
			cmax(ans,gcd(now,query(x,r)));
			if(ct==k)return ;
			for(auto [p,x]:suf[x]){
				dfs(p+1,ct+1,now);
				now=gcd(now,x);
			}
		};
		dfs(l,0,0);
		cout << ans << '\n';
	}
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}