Problem: This time Baby Ehab will only cut and not stick. He starts with a piece of paper with an array a of length n written on it, and then he does the following:

  * he picks a range (l, r) and cuts the subsegment a_l, a_{l + 1}, …, a_r out, removing the rest of the array. 
  * he then cuts this range into multiple subranges. 
  * to add a number theory spice to it, he requires that the elements of every subrange must have their product equal to their [least common multiple (LCM)](https://en.wikipedia.org/wiki/Least_common_multiple). 



Formally, he partitions the elements of a_l, a_{l + 1}, …, a_r into contiguous subarrays such that the product of every subarray is equal to its LCM. Now, for q independent ranges (l, r), tell Baby Ehab the minimum number of subarrays he needs.

Input

The first line contains 2 integers n and q (1 ≤ n,q ≤ 10^5) — the length of the array a and the number of queries.

The next line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^5) — the elements of the array a.

Each of the next q lines contains 2 integers l and r (1 ≤ l ≤ r ≤ n) — the endpoints of this query's interval.

Output

For each query, print its answer on a new line.

Example

Input


6 3
2 3 10 7 5 14
1 6
2 4
3 5


Output


3
1
2

Note

The first query asks about the whole array. You can partition it into [2], [3,10,7], and [5,14]. The first subrange has product and LCM equal to 2. The second has product and LCM equal to 210. And the third has product and LCM equal to 70. Another possible partitioning is [2,3], [10,7], and [5,14].

The second query asks about the range (2,4). Its product is equal to its LCM, so you don't need to partition it further.

The last query asks about the range (3,5). You can partition it into [10,7] and [5].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = int64_t;
using ar2 = array<int, 2>;
template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using max_heap = priority_queue<T>;

const int thicc = 1e9 + 10, smol = -thicc;
const ll rilly_thicc = 1e18 + 10, rilly_smol = -rilly_thicc;

const int maxn = 1e5 + 10, maxk = 17;
int n, q, a[maxn], last[maxn], lift[maxn][maxk];
vector<int> fact[maxn];
void solve() {
  scanf("%d%d", &n, &q);
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  for (int i = 0; i < n; ++i) {
    int t = a[i];
    for (int j = 2; j * j <= n; ++j) {
      if (t % j == 0) fact[i].push_back(j);
      while (t % j == 0) t /= j;
    }
    if (t != 1) fact[i].push_back(t);
  }
  set<int> in;
  int j = 0;
  for (int i = 0; i < n; ++i) {
    while (j < n) {
      bool ok = true;
      for (int f : fact[j])
        if (in.count(f)) ok = false;
      if (!ok) break;
      for (int f : fact[j]) in.insert(f);
      ++j;
    }
    last[i] = j;
    for (int f : fact[i]) in.erase(f);
  }
  for (int j = 0; j < maxk; ++j) lift[n][j] = n;
  for (int i = n - 1; i >= 0; --i) {
    lift[i][0] = last[i];
    for (int j = 1; j < maxk; ++j) {
      lift[i][j] = lift[lift[i][j - 1]][j - 1];
    }
  }
  // for (int i = 0; i < n; ++i) {
  //   for (int j = 0; j < 5; ++j) printf("%d ", lift[i][j]);
  //   puts("");
  // }
  // for (int i = 0; i < n; ++i) printf("%d ", last[i]);
  // puts("");
  for (int i = 0; i < q; ++i) {
    int l, r;
    scanf("%d%d", &l, &r);
    --l, --r;
    int left = 0, right = n+1;
    while (left + 1 < right) {
      int mid = (left + right) / 2;
      int cur = l;
      for (int j = 0; j < maxk; ++j) {
        if ((mid >> j) & 1) {
          cur = lift[cur][j];
        }
      }
      // printf("%d %d %d %d\n", left, right, mid, cur);
      if (cur < r+1) left = mid;
      else right = mid;
    }
    printf("%d\n", right);
  }
}

int main() {
  // freopen("propagation.in", "r", stdin);
  // freopen("propagation.out", "w", stdout);
  int tc = 1;
  // scanf("%d", &tc);

  for (int i = 1; i <= tc; ++i) {
    // printf("Case #%d: ", i);
    solve();
  }
}