#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 100010;

ll gcd(ll a, ll b) {
    while( b != 0 ) {
        a %= b;
        swap(a, b);
    }
    return a;
}

int n, q;

ll v[maxn];
ll seg[4*maxn];

void update(int node, int l, int r, int i, ll val)
{
    if( i < l || r < i )
        return;

    if( l == r )
    {
        seg[node] = val;
        return;
    }

    int m = ( l + r )/2;

    update( 2*node , l , m , i , val );
    update( 2*node + 1 , m + 1 , r , i , val );

    seg[node] = gcd( seg[2*node] , seg[2*node + 1] );
}

ll query(int node, int l, int r, int i, int j)
{
    if( j < l || r < i )
        return 0;

    if( i <= l && r <= j )
        return seg[node];

    int m = ( l + r )/2;

    ll gcdLeft = query( 2*node , l , m , i , j );
    ll gcdRight = query( 2*node + 1 , m + 1 , r , i , j );

    return gcd( gcdLeft , gcdRight );
}

int bs(int node, int l, int r, int i, ll val)
{
    if( r < i || seg[node]%val == 0 )
        return -1;

    if( l == r )
        return l;

    int m = ( l + r )/2;
    int ansLeft = bs( 2*node , l , m , i , val );

    if( ansLeft != -1 )
        return ansLeft;

    return bs( 2*node + 1 , m + 1 , r , i , val );
}

ll query(int l, int r, int k)
{
    if( k == 0 )
        return query( 1 , 1 , n , l , r );

    ll ans = query( l + 1 , r , k - 1 );

    ll curGCD = v[l];
    ll allGCD = query( 1 , 1 , n , l , r );

    int p = l;

    while( curGCD > allGCD )
    {
        p = bs( 1 , 1 , n , p , curGCD );

        if( r < p )
            break;

        update( 1 , 1 , n , p , 0 );
        ans = max( ans , query( l , r , k - 1 ) );
        update( 1 , 1 , n , p , v[p] );

        curGCD = gcd( curGCD , v[p] );
    }

    return ans;
}

int main()
{
    cin >> n >> q;

    for(int i = 1 ; i <= n ; i++)
        cin >> v[i];

    for(int i = 1 ; i <= n ; i++)
        update( 1 , 1 , n , i , v[i] );

    for(int i = 1 ; i <= q ; i++)
    {
        int l, r, k;
        cin >> l >> r >> k;

        cout << query( l , r , k ) << endl;
    }
}