#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;

#pragma comment(linker, "/STACK:102400000,102400000")
#define ls i<<1
#define rs ls | 1
#define mid ((ll+rr)>>1)
#define pii pair<int,int>
#define MP make_pair

typedef long long LL;
const long long INF = 1e18;
const double Pi = acos(-1.0);
const int N = 1e5+10, M = 1e2+11, mod = 1e9+7, inf = 2e9;


int dp[N][50],a[N],n,q;
void st() {
        for(int j = 1; (1<<j) <= n; ++j) {
            for(int i = 1; (i + (1<<j) - 1) <= n; ++i) {
                dp[i][j] = min(dp[i][j-1],dp[i + (1<<(j-1))][j-1]);
            }
        }
}
int query(int l,int r) {
        int len = r - l + 1;
        int k = 0;
        while ((1 << (k + 1)) <= len) k++;
        return min(dp[l][k],dp[r - (1<<k) + 1][k]);
}
int _binary_search(int l,int r,int res) {
        int s = r+1;
        while(l <= r) {
            int md = (l + r) >> 1;
            if(query(l,md) <= res) r = md - 1,s = md;
            else l = md + 1;
        }
        return s;
}
int main() {
        int T;
        scanf("%d",&T);
        while(T--) {
            scanf("%d",&n);
            for(int i = 1; i <= n; ++i) scanf("%d",&a[i]),dp[i][0]=a[i];
            st();
            scanf("%d",&q);
            for(int i = 1; i <= q; ++i) {
                int x,y,L,R;
                scanf("%d%d",&x,&y);
                int res = a[x];
                L = x+1, R = y;
                while(L <= R && res) {
                   L = _binary_search(L,R,res);
                   if(L<=R) {
                        res%=a[L];L++;
                   }
                }
                printf("%d\n",res);
            }
        }
        return 0;
}