#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <array>
#include <stack>
#include <queue>
#include <random>
#include <numeric>
#include <functional>
#include <chrono>
#include <utility>
#include <iomanip>
#include <assert.h>

using namespace std;

void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)

#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rng_seed(x) mt19937 rng(x)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
// #define int long long

const int MXN = 1e5 + 5, INF = 1e9 + 5, K = 19;
int N, Q;
int spf[MXN], factor_cnt[MXN], par[MXN][K], depth[MXN];
vector<int> factors[MXN];
vector<int> g[MXN];

bool add(int idx) {
    for (const auto &factor : factors[idx])
        if (factor_cnt[factor] > 0)
            return false;

    for (const auto &factor : factors[idx])
        factor_cnt[factor]++;

    return true;
}

void remove(int idx) {
    for (const auto &factor : factors[idx])
        factor_cnt[factor]--;
}

void dfs(int u, int p, int dep) {
    depth[u] = dep;

    for (int j = 1; j < K; j++)
        par[u][j] = par[par[u][j - 1]][j - 1];

    for (const auto &v : g[u]) {
        if (v == p) continue;

        par[v][0] = u;
        dfs(v, u, dep + 1);
    }
}

int query(int l, int r) {
    int u = l;

    for (int j = K - 1; j >= 0; j--) {
        int lift = par[u][j];

        if (lift > r) continue;
        u = lift;
    }

    u = par[u][0];
    return depth[l] - depth[u];
}

void solve() {
    cin >> N >> Q;

    vector<int> A(N);
    for (auto &x : A)
        cin >> x;


    spf[1] = 1;
    for (int i = 2; i < MXN; i++) {
        if (spf[i] > 0) continue;

        for (int j = i; j < MXN; j += i)
            spf[j] = i;
    }

    for (int i = 0; i < N; i++) {
        int x = A[i];

        while (x != 1) {
            factors[i].push_back(spf[x]);
            x /= spf[x];
        }
    }

    vector<int> earliest(N, N + 1);
    for (int i = 0, j = 0; i < N; i++) {
        while (j < N && add(j))
            j++;

        earliest[i] = j;

        remove(i);
    }

    for (int i = 0; i < N; i++) {
        g[i].push_back(earliest[i]);
        g[earliest[i]].push_back(i);
    }

    for (int i = 0; i < MXN; i++)
        for (int j = 0; j < K; j++)
            par[i][j] = N;

    dfs(N, -1, 0);

    while (Q--) {
        int l, r;
        cin >> l >> r;
        l--, r--;

        cout << query(l, r) << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int TC = 1;
    // cin >> TC;
    while (TC--) solve();
}