#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ " = "), debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define gc getchar
#define pc putchar
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

using namespace std;

template <class T = int> T read() {
  T x = 0; bool f = 0; char ch = gc();
  while (!isdigit(ch)) f = ch == '-', ch = gc();
  while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = gc();
  return f ? -x: x;
}
template <class T> void write(T x) {
  if (x >= 0) { if (x > 9) write(x / 10); pc(x % 10 + 48); }
  else { pc('-'); if (x < -9) write(-x / 10); pc(48 - x % 10); }
}

const int N = 100010;

int n, q;
ll a[N], st[N][21], ans;

ll qry(int l, int r) {
  int k = __lg(r - l + 1);
  return __gcd(st[l][k], st[r - (1 << k) + 1][k]);
}

bool check(int l, int r, ll d) {
  int k = __lg(r - l + 1);
  return (st[l][k] % d == 0) && (st[r - (1 << k) + 1][k] % d == 0);
}

void solve(int l, int r, int k, ll d) {
  if (k == 0 && l > r) return ans = max(ans, d), void();
  if (r - l + 1 < k) return;
  if (k == 0) {
    d = __gcd(d, qry(l, r));
    return ans = max(ans, d), void();
  }
  solve(l + 1, r, k - 1, d), d = __gcd(d, a[l]);
  for (int x = l, y; x <= r; x = y + 1) {
    y = x;
    per (i, 20, 0) {
      if (y + (1 << i) - 1 > r) continue;
      if (st[y][i] % d != 0) continue;
      y += (1 << i);
    }
    y--, solve(y + 1, r, k, d);
    d = __gcd(d, a[y + 1]);
  }
}

int main() {
  n = read(), q = read();
  rep (i, 1, n) a[i] = read<ll>();
  rep (i, 1, n) st[i][0] = a[i];
  rep (j, 1, 20) rep (i, 1, n - (1 << j) + 1)
    st[i][j] = __gcd(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
  while (q--) {
    int l = read(), r = read(), k = read();
    ans = 0, solve(l, r, k, 0);
    write(ans), pc(10);
  }
}