#include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
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,m;
    cin>>n>>m;
    int x[n];
    for(int i=0;i<n;i++){
        cin>>x[i];
    }
    for(int i=0;i<m;i++){
        int l,r,u;
        cin>>l>>r>>u;
        l--; r--;
        int minimum=2e9;
        for(int j=l;j<=r;j++){
            int a=sqrt(x[j]);
            for(int k=1;k<=a;k++){
                if(x[j]%k==0){
                    if(is_prime[k]==true){
                        minimum=min(minimum,abs(k-u));
                    }
                    if(is_prime[x[j]/k]==true){
                        minimum=min(minimum,abs(x[j]/k-u));
                    }
                }
            }
        }

        cout<<minimum<<endl;

    }


    return 0;
}