#include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 1;
const int INF = 2e9;
bool is_prime[maxn];
int main() {
    ios_base::sync_with_stdio(false);

    memset(is_prime, true, sizeof is_prime);
    is_prime[0] = false;
    is_prime[1] = false;

    for(ll i = 2; i <= maxn; i++) {
        if(is_prime[i]) {
            for(ll j = i * i; j <= maxn; j += i) {
                is_prime[j] = false;
            }
        }
    }

    int n, q;
    cin >> n >> q;
    vector<int> v(n);
    vector<int> divs[n];
    for(int i = 0; i < n; i++) {
        cin >> v[i];

        int sq = sqrt(v[i]);

        for(int j = 1; j <= sq; j++) {
            if(v[i] % j == 0) {
                if(is_prime[j]) {
                    divs[i].push_back(j);
                }

                if(j != v[i] / j) {
                    if(is_prime[v[i] / j]) {
                        divs[i].push_back(v[i] / j);
                    }
                }
            }
        }
    }

    for(int i = 0; i < q; i++) {
        int L, R, x;
        cin >> L >> R >> x;
        L--; R--;

        int res = INF;
        for(int j = L; j <= R; j++) {
            for(int c: divs[j]) {
                res = min(res, abs(c - x));
            }
        }
        cout << res << " ";

    }


    return 0;
}