#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"

void solve() {
    int n, x;
    cin >> n >> x;
    
    // Get prime factorization of x
    map<int, int> x_primes;
    int temp_x = x;
    for(int i = 2; i * i <= temp_x; i++) {
        while(temp_x % i == 0) {
            x_primes[i]++;
            temp_x /= i;
        }
    }
    if(temp_x > 1) {
        x_primes[temp_x]++;
    }
    
    vector<int> arr(n);
    for(int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    
    // For each position, store count of prime factors
    vector<map<int, int>> prefix(n);
    for(int i = 0; i < n; i++) {
        int curr = arr[i];
        // Only factorize primes that are in x
        for(auto &[prime, count] : x_primes) {
            int cnt = 0;
            while(curr % prime == 0) {
                cnt++;
                curr /= prime;
            }
            prefix[i][prime] = cnt;
        }
        
        // Add previous counts
        if(i > 0) {
            for(auto &[prime, count] : x_primes) {
                prefix[i][prime] += prefix[i-1][prime];
            }
        }
    }
    
    int q;
    cin >> q;
    while(q--) {
        int l, r;
        cin >> l >> r;
        l--; r--;  // Convert to 0-based indexing
        
        bool possible = true;
        // Check if range has enough of each prime factor
        for(auto &[prime, needed] : x_primes) {
            int has = prefix[r][prime];
            if(l > 0) {
                has -= prefix[l-1][prime];
            }
            if(has < needed) {
                possible = false;
                break;
            }
        }
        
        cout << (possible ? "Yes" : "No") << endl;
    }
    cout << endl;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}