#include <bits/stdc++.h>
using namespace std;

#define int long long

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;
    cin >> t;
    while (t--) {
        int n, x;
        cin >> n >> x;
        vector<int> a(n);
        for (int i = 0; i < n; i++) cin >> a[i];
        
        int q;
        cin >> q;
        
        vector<pair<int, int>> factors;
        int cx = x;
        for (int i = 2; i * i <= cx; i++) {
            int ct = 0;
            while (cx % i == 0) {
                ++ct;
                cx /= i;
            }
            if (ct > 0) factors.push_back({i, ct});
        }
        if (cx > 1) factors.push_back({cx, 1});
        
        int f_size = factors.size();
        vector<vector<int>> pp(f_size, vector<int>(n, 0));
        
        for (int i = 0; i < f_size; i++) {
            int prime = factors[i].first;
            for (int j = 0; j < n; j++) {
                int temp = a[j], ct = 0;
                while (temp % prime == 0) {
                    ct++;
                    temp /= prime;
                }
                pp[i][j] = ct;
            }
        }
        
        for (int i = 0; i < f_size; i++) {
            for (int j = 1; j < n; j++) {
                pp[i][j] += pp[i][j - 1];
            }
        }
        
        while (q--) {
            int l, r;
            cin >> l >> r;
            --l, --r;
            int ct = 0;
            for (int i = 0; i < f_size; i++) {
                int sum = pp[i][r] - (l > 0 ? pp[i][l - 1] : 0);
                if (sum >= factors[i].second) ++ct;
            }
            cout << (ct == f_size ? "Yes" : "No") << "\n";
        }
    }
    return 0;
}