#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp> 
#include<ext/pb_ds/tree_policy.hpp>
#include<functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;

#define int long long int
#define F first
#define S second
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int,int>
#define vpi vector<pii>
#define vpp vector<pair<int,pii>>
#define mii map<int,int>
#define mpi map<pii,int>
#define spi set<pii>
#define endl "\n"
#define sz(x) ((int) x.size())
#define all(p) p.begin(), p.end()
#define double long double
#define que_max priority_queue <int>
#define que_min priority_queue<int,vi,greater<int>>
#define bug(...) __f (#__VA_ARGS__,__VA_ARGS__)
#define forn(x,n) for(int x = 0; x < n; x++)
#define print(a) for(auto x : a) cout<<x<<" ";cout<<endl;
#define print1(a) for(auto x : a) cout<<x.F<<" "<<x.S<<endl;
#define print2(a,x,y) for(int i=x;i<y;i++) cout<<a[i]<<" ";cout<<endl;
#define py cout<<"Yes"<<endl;
#define pn cout<<"No"<<endl;
#define out(x) cout<<x<<endl;


double epsilon = 1e-18;

int mod=1e9+7;

inline int power(int a, int b)
{
    int x = 1;
    while(b)
    {
        if(b&1) x=(x*a)%mod;
        a=(a*a)%mod;
        b >>=1;
    } 
    return x;
}


 
template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
    const char* comma = strchr (names + 1, ',');
    cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
} 


void solve(){
	int n,x;
	cin>>n>>x;
	map<int,int> tar;
	for(int i=2;i*i<=x;i++){
		while(x%i==0){
			tar[i]+=1;
			x/=i;
		}
	}
	if(x>1){
		tar[x]+=1;
	}

	int arr[n];
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	vector<map<int,int>> v(n);
	for(int i=0;i<n;i++){
		int temp=arr[i];
		for(auto &it:tar){
			int t = it.first;
			while(temp%t==0){
				temp/=t;
				v[i][t]+=1;
			}
		}
		if(i){
			for(auto &it:tar){
				v[i][it.first]+=v[i-1][it.first];
			}
		}
	}

	int q;cin>>q;
	while(q--){
		int l,r;cin>>l>>r;
		l-=1;r-=1;
		map<int,int> temp = v[r];
		if(l-1>=0){
			for(auto &it:tar){
				temp[it.first]-=v[l-1][it.first];
			}
		}

		int f=1;
		for(auto &it:tar){
			if(temp[it.first]<tar[it.first]){
				f=0;break;
			}
		}

		if(f==0){
			cout<<"No"<<endl;
		}
		else{
			cout<<"Yes"<<endl;
		}
	}

}    
 
  
     
int32_t main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    // clock_t z = clock();

    int t = 1;
    cin >> t;
    for(int i=1;i<=t;i++){
        solve();
    }

    // cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);
 
    return 0;
}