#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)


ll a[100010],c[100010];
vector<ll> m={1000000007,1000000009,1000000021,1000000033,1000000087};


int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;

	ll n,q,k;
	cin >> n >> q >> k;
	for(i=1;i<=n;i++) cin >> a[i];

	while(q--){
	ll l,r;
	cin >> l >> r;

	bool f=true;
	REP(j,5){

	ll MOD=m[j];
	ll K=k%MOD;
	ll e=1;
	for(i=1;i<=n;i++){
		ll A=a[i]%MOD;
		A+=MOD;

		c[i]=(A*e)%MOD;

		e*=K;
		e%=MOD;
	}

	for(i=1;i<=n;i++){
		c[i]+=c[i-1];
		c[i]%=MOD;
	}


	if((c[r]-c[l-1]+MOD)%MOD!=0){
		f=false;
		cout << "Yes" << endl;
		break;
	}
	}

	if(f) cout << "No" << endl;

	}




	return 0;
}