#include<set>

 #include<cmath>

 #include<queue>

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #define trav(u,i) for(int i=front[u];i;i=e[i].nxt)

 #define FOR(a,b,c) for(int a=(b);a<=(c);a++)

 using namespace std;

 typedef unsigned long long ll;

 const int N = 2e5+;

 ll read() {

     char c=getchar();

     ll f=,x=;

     while(!isdigit(c)) {

         if(c=='-') f=-; c=getchar();

     }

     while(isdigit(c))

         x=x*+c-'',c=getchar();

     return x*f;

 }

 struct Tnode {

     Tnode *ls,*rs;

     int val;

 } *T[N],mempool[N*],*G=mempool;

 Tnode * Nw (Tnode*l,Tnode*r,int x) {

     G->ls=l,G->rs=r,G->val=x;

     return G++;

 }

 Tnode* build(Tnode* p,ll l,ll r,ll pos) {

     if(l==r) return Nw (0x0,0x0,p->val+);

     else {

         ll mid=l+((r-l)>>);

         if(pos<=mid) return Nw (build(p->ls,l,mid,pos),p->rs,p->val);

         else return Nw (p->ls,build(p->rs,mid+,r,pos),p->val);

     }

 }

 int query(Tnode*x,Tnode*y,ll l,ll r,ll pos) {

     if(l==r) return y->val - x->val;

     else {

         ll mid=l+((r-l)>>);

         if(pos<=mid) return query(x->ls,y->ls,l,mid,pos);

         else return query(x->rs,y->rs,mid+,r,pos);

     }

 }

 int n,m,K,a;

 ll H[N],xp=,X=;

 int main()

 {

 //    freopen("in.in","r",stdin);

 //    freopen("out.out","w",stdout);

     n=read(),m=read(),K=read();

     FOR(i,,n) {

         a=read();

         H[i]=H[i-]*X+a;

     }

     FOR(i,,K) xp*=X;

     int l,r;

     T[K-]=Nw (G,G,);

     FOR(i,K,n)

         T[i]=build(T[i-],0ull,18446744073709551615ull,H[i]-H[i-K]*xp);

     FOR(i,,m) {

         l=read(),r=read();

         ll H=;

         FOR(j,,K) {

             a=read();

             H=H*X+a;

         }

         if(r-l+<K) { puts("Yes"); continue; }

         if(query(T[l+K-],T[r],0ull,18446744073709551615ull,H) > ) puts("No");

         else puts("Yes");

     }

     return ;

 }