#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e5 + 5;
const int LB = 18 + 2;
const ll linf = 0x3f3f3f3f3f3f3f3f;

ll gcd(ll a,ll b){ return b? gcd(b,a%b): a;}

int lb[MAXN];

int n;
ll a[MAXN];
ll f[MAXN][LB];

ll getf(int l,int r)
{
	int k = lb[r-l+1];
	return gcd(f[l][k], f[r-(1<<k)+1][k]);
}

ll query(int l,int r,int k)
{
	if(r-l+1 == k) return 0;
	if(k == 0) return getf(l, r);
	
	int lim = r - k, pos = l-1;
	ll res = -linf, cur = 0;
	while(1)
	{
		if(cur)
		{
			for(int i=lb[lim-pos]; i>=0 && pos<lim; --i)
				if(i<=lb[lim-pos] && f[pos+1][i] % cur == 0)
					pos += 1<<i;
		}
		res = max(res, gcd(cur, query(pos+2, r, k-1)));
		
		if(pos == lim) break;
		++pos;
		cur = gcd(cur, a[pos]);
	}
	return res;
}

int main(void)
{
	lb[0] = -1;
	for(int i=1; i<MAXN; ++i)
		lb[i] = lb[i>>1] + 1;
	
	int Q;
	scanf("%d%d",&n,&Q);
	for(int i=1; i<=n; ++i)
		scanf("%lld",&a[i]);
	
	for(int i=n; i>=1; --i)
	{
		f[i][0] = a[i];
		for(int j=1; i+(1<<j)-1<=n; ++j)
			f[i][j] = gcd(f[i][j-1], f[i+(1<<(j-1))][j-1]);
	}
	
	while(Q--)
	{
		int l,r,k;
		scanf("%d%d%d",&l,&r,&k);
		printf("%lld\n",query(l,r,k));
	}
	return 0;
}