func_code_string:       //Shrey Dubey         #include<iostream>   #include<string>   #include<algorithm>   #include<map>   #include<unordered_map>   #include<vector>   #include<set>   #include<list>   #include<iomanip>   #include<queue>   #include<stack>   #include <math.h>   #include<climits>   #include<bitset>   #include<cstring>   #include<numeric>   #include<array>         using namespace std;   typedef long long ll;   typedef long double ld;      #define YES cout<< YES n    #define Yes cout<< Yes n    #define NO cout<< NO n    #define No cout<< No n    #define prDouble(x) cout<<fixed<<setprecision(10)<<x //to print decimal numbers   #define pb push_back   #define ff first   #define sec second   #define umap unordered_map   #define mp make_pair   #define KOBE ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)   #define fo(n) for(ll i = 0; i<n; i++)   #define fnd(stl, data) find(stl.begin(), stl.end(), data)   #define forn(x,n) for(ll x = 0; x<n; x++)   #define imax INT_MAX   #define lmax LLONG_MAX   #define imin INT_MIN   #define lmin LLONG_MIN   #define vi vector<int>   #define vl vector<ll>   #define vp vector<pair<ll,ll> >   #define vs vector<string>   #define vb vector<bool>   #define pr(t) cout<<t<<  n    #define int long long   #define ql queue<ll>   #define qp queue<pair<ll,ll> >   #define endl   n    #define nl cout<<  n    #define re cin >>   #define pll pair<ll,ll>   #define FOR(a,b) for(ll i = a; i<=b; i++)   #define all(x) x.begin(),x.end()   #define LG 22      // ll dx[] = {1,0,-1,0};   // ll dy[] = {0,1,0,-1};      ll mod = 1e9 + 7;      ll cl(ld a){       if(a>(ll) a){           return (ll)a+1;       }       else{           return (ll)a;       }   }      ll flr(ld a){       if(a < 0.0){           return (ll) a - 1;       }       return (ll) a;   }      ll gcd(ll a, ll b){       if(b == 0) return a;       else return gcd(b,a%b);   }      //code starts here      ll n,q;   const ll M = 1e5+100;   ll nxt[M] = {0}, a[M];   ll dp[LG][M] = {0};   vl fact[M];   void solve(){       re n; re q;       fo(n) re a[i+1];       for(ll i = 2; i<M; i++){           if(!fact[i].empty()) continue;           for(ll j = i; j<M; j+=i){               nxt[i] = n+1;               fact[j].pb(i);           }       }       dp[0][n+1] = n+1;       for(ll i = n; i>=1; i--){           dp[0][i] = dp[0][i+1];           for(auto f: fact[a[i]]){               // if(i == 6 && f == 7) pr( here );               dp[0][i] = min(dp[0][i],nxt[f]);               nxt[f] = i;           }           // cout<<i<< () <<dp[0][i]<<  n ;       }          for(ll j = 1; j<20; j++){           for(ll i = 1; i<=n+1; i++){               ll k = dp[j-1][i];               dp[j][i] = dp[j-1][k];           }       }       while(q--){           ll l,r; re l; re r;           ll ans = 0;           for(ll i = 19; i>=0; i--){               if(dp[i][l] <= r){                   // cout<<l<< () n ;                   ans += (1<<i);                   l = dp[i][l];               }           }           pr(ans+1);       }   }      int32_t main(){       KOBE;       ll t;       t = 1;       // re t;       while(t--) solve();   }         //common errors   // row - n, col - m always and loop var   // see the freq of numbers carefully   // see if there s array overflow   // use map for large inputs   // always check for n = 1 condition   // check loop starting and end points :(      //problem ideas   //check piegonhole wherever possible   //there might be many instances of limited answers like 0,1,2 only   // see suffix and prefix   //don t be obsessed with binary search   // try to find repeating pattern in matrices   