#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 M[100010],m[100010],c[100010]; const ll MOD=998244353,mod=1e9+7,C=1e9+9; int main(void){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll i,j; ll n,q,k; cin >> n >> q >> k; ll kM=k%MOD,km=k%mod,kc=k%C; ll eM=1,em=1,eC=1; for(i=1;i<=n;i++){ ll a; cin >> a; ll AM=a%MOD,am=a%mod,ac=a%C; AM+=MOD; am+=mod; ac+=C; M[i]=(AM*eM)%MOD; m[i]=(am*em)%mod; c[i]=(ac*eC)%C; eM*=kM; eM%=MOD; em*=km; em%=mod; eC*=kc; eC%=C; } for(i=1;i<=n;i++){ M[i]+=M[i-1]; M[i]%=MOD; m[i]+=m[i-1]; m[i]%=mod; c[i]+=c[i-1]; c[i]%=C; } while(q--){ ll l,r; cin >> l >> r; if((M[r]-M[l-1]+MOD)%MOD==0 && (m[r]-m[l-1]+mod)%mod==0 && (c[r]-c[l-1]+C)%C==0) cout << "No" << endl; else cout << "Yes" << endl; } return 0; }