Codechef_gcd_queries_IMP.cpp

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
    int T;
    cin>>T;
    while(T--){
        int n,q;
        cin>>n>>q;
        int a[n+10];
        int forward[n+10];
        int backward[n+10];
        forward[0] = backward[n+1] = 0;
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        for(int i=1;i<=n-1;i++){
            forward[i] = __gcd(forward[i-1],a[i]);
        }
        for(int i=n;i>=1;i--){
            backward[i] = __gcd(backward[i+1],a[i]);
        }
        while(q--){
            int l,r;
            cin>>l>>r;
            cout<<__gcd(forward[l-1],backward[r+1])<<endl;
        }
    }
return 0;
}