#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}


bool prime(int x){
    int a=2;
    while(a*a<=x){
        if(x%a==0) return false;
        a++;
    }
    return true;
}

int mod;



void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    ll N,Q,K;
    cin>>N>>Q>>K;
    ll T=20;
    random_device seed_gen;
    mt19937 engine(seed_gen());
    vector<ll> A(N);
    rep(i,0,N) cin>>A[i];
    vector<int> L(Q),R(Q);
    rep(i,0,Q) cin>>L[i]>>R[i],L[i]--;
    vector<bool> ans(Q,1);
    while(T){
        mod=(int)engine();
        if(mod<0||!prime(mod)) continue;
        T--;
        ll k=K%mod;
        vector<ll> sum(1+N);
        ll tmp=1;
        rep(i,0,N){
            sum[i+1]=(sum[i]+tmp*(A[i]))%mod;
            sum[i+1]=(sum[i+1]+mod)%mod;
            tmp=(tmp*k)%mod;
        }
        rep(i,0,Q) if(sum[L[i]]==sum[R[i]]) ans[i]=0;
    }
    rep(i,0,Q) yneos(ans[i]);
}