func_code_string: #include <bits/stdc++.h>   using namespace std;   using uint = unsigned int;   using ll = long long;   using ull = unsigned long long;   using pii = pair<int, int>;   template <typename T1, typename T2>   ostream &operator<<(ostream &out, const pair<T1, T2> &item) {     out <<  (  << item.first <<  ,   << item.second <<  ) ;     return out;   }   template <typename T>   ostream &operator<<(ostream &out, const vector<T> &v) {     for (const auto &item : v) out << item <<    ;     return out;   }   int n, lpd[5100000];   int last[5100000][8];   int st[15][2 * 200010];   void update(int p, int nr, int pos) {     if (st[nr][p += n] >= pos) return;     for (st[nr][p] = pos; p > 1; p >>= 1)       st[nr][p >> 1] = max(st[nr][p], st[nr][p ^ 1]);   }   int query(int nr, int l, int r) {     int res;     for (res = -1, l += n, r += n; l < r; l >>= 1, r >>= 1) {       if (l & 1) res = max(res, st[nr][l++]);       if (r & 1) res = max(res, st[nr][--r]);     }     return res;   }   void process(int a, int i) {     int p, e;     vector<int> d;     while (a > 1) {       for (e = 0, p = lpd[a]; a % p == 0; ++e) a /= p;       if (e & 1) d.push_back(p);     }     int n = d.size();     for (int cfg = 0; cfg < (1 << n); ++cfg) {       int j, val, s;       for (s = 0, val = 1, j = 0; j < n; ++j)         if (cfg & (1 << j)) val *= d[j], ++s;       for (int nr = 0; nr <= 7; ++nr) update(i, n - s + nr, last[val][nr]);       last[val][n - s] = i;     }   }   int main() {     ios_base::sync_with_stdio(false);     int i, q, a, l, r, ans;     for (i = 1; i < 5100000; ++i) lpd[i] = i;     for (i = 2; i < 5100000; ++i) {       if (lpd[i] != i) continue;       for (ll j = 1LL * i * i; j < 5100000; j += i) lpd[j] = min(lpd[j], i);     }     cin >> n >> q;     memset(st, -1, sizeof st);     memset(last, -1, sizeof last);     for (i = 0; i < n; ++i) {       cin >> a;       process(a, i);     }     while (q--) {       cin >> l >> r;       for (ans = 0; ans <= 14; ++ans)         if (query(ans, l - 1, r) >= l - 1) {           cout << ans <<   n ;           break;         }     }     return 0;   }   