#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll N,Q,K;
ll A[202020];
ll S[3][202020];
ll mo[3];

//素数判定
bool isprime(ll v) {
	for(ll i=2;i*i<=v;i++) if(v%i==0) return false;
	return (v!=1);
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>Q>>K;
	srand(time(NULL));
	FOR(i,3) {
		while(1) {
			ll a=1000000000+rand()%100000000;
			if(__gcd(a,K)>1) continue;
			if(isprime(a)==0) continue;
			mo[i]=a;
			break;
		}
	}
	ll nk[3]={1,1,1};
	FOR(i,N) {
		cin>>A[i];
		FOR(j,3) {
			S[j][i+1]=(S[j][i]+(A[i]%mo[j]*nk[j]%mo[j])+mo[j])%mo[j];
			nk[j]=nk[j]*(K%mo[j])%mo[j];
		}
	}
	while(Q--) {
		int L,R;
		cin>>L>>R;
		L--;
		int ng=0;
		FOR(i,3) if((S[i][R]-S[i][L]+mo[i])%mo[i]==0) ng++;
		if(ng==3) {
			cout<<"No"<<endl;
		}
		else {
			cout<<"Yes"<<endl;
		}
	}
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}