#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mod 1000000007
// #define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 1e6 + 10;
vector<int> spf(N);
gp_hash_table<int, vector<int>>prime;
void sieve()///=> O(n log(log(n)))
{
    for(int i=1; i<N; i++)
    {
        spf[i]=i;
    }
    for(int i=2; i*i<N; i++)
    {
        if(spf[i]==i)
        {
            for(int j=i*i; j<N; j+=i)
            {
                if(spf[j]==j) spf[j]=i;
            }
        }
    }
}

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> v(n);
    gp_hash_table<int, vector<int>>mp;
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
        if(prime[v[i]].size() != 0){
            for(auto it : prime[v[i]]){
                mp[it].push_back(i + 1);
            }
            continue;
        }
        if(v[i] < N){
            int temp = v[i];
            while (v[i] != 1) //=> O(log(n));
            {
                mp[spf[v[i]]].push_back(i + 1);
                prime[temp].push_back(spf[v[i]]);
                v[i] /= spf[v[i]];
            }
        }
        else{
            int temp;
            for (int j = 2; j * j <= v[i]; j++)
            {
                temp = v[i];
                if (v[i] % j == 0)
                {
                    while (v[i] % j == 0)
                    {
                        mp[j].push_back(i + 1);
                        prime[v[i]].push_back(j);
                        v[i] /= j;
                    }
                }
            }
            if (v[i] > 1)
                mp[v[i]].push_back(i + 1);
                prime[temp].push_back(v[i]);
        }
    }
    gp_hash_table<int, int> gp;
    if(m < N){
        while (m != 1) //=> O(log(n));
        {
            gp[spf[m]]++;
            m /= spf[m];
        }
    }
    else{
        for (int j = 2; j * j <= m; j++)
        {
            if (m % j == 0)
            {
                while (m % j == 0)
                {
                    gp[j]++;
                    m /= j;
                }
            }
        }
        if (m > 1)
            gp[m]++;
    }
    
    
    vector<pair<int,int>>vec;
    for(auto it : gp){
        vec.push_back({it.first, it.second});
    }
    
    // for(auto it : mp){
    //     cout << it.first << "-->";
    //     for(auto i : it.second){
    //         cout << i << " ";
    //     }
    //     cout << endl;
    // }

    int q, l, r;
    cin >> q;
    while(q--){
        cin >> l >> r;
        bool ok = 0;
        for(auto it : vec)
        {
            auto first = lower_bound(all(mp[it.first]), l);
            if(first == mp[it.first].end()){
                ok = 1;
                break;
            }
            auto sec = upper_bound(all(mp[it.first]), r);
            sec--;
            int left = first - mp[it.first].begin();
            int right = sec - mp[it.first].begin();
            if(right < 0){
                ok = 1;
                break;
            }
            
            if(right < left){
                ok = 1;
                break;
            }
            int ase = right - left + 1;
            if(ase < it.second){
                ok = 1;
                break;
            }
        }
        if(ok){
            cout << "No" << endl;
        }
        else{
            cout << "Yes" << endl;
        }

    }

}

int32_t main()
{
    Abid_52;
    int t = 1;
    cin >> t;
    sieve();
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}