Language: C++

#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using vec=vector<ll>;
using mat=vector<vec>;
#define For(i,a,b) for(ll i=a;i<b;i++)
#define bFor(i,a,b) for(ll i=a;i>=b;i--)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N-1,0)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define mod 1000000007
#define endl "\n"
#define output(v) do{bool f=0;for(auto i:v){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}while(0)
using datas=pair<ll,ll>;
using tdata=pair<ll,datas>;

long mmid(long a,long b,long c){return a<b?(b<c?b:max(a,c)):(b>c?b:min(a,c));}

ll lpow(ll a,ll b){
  ll res=1;
  rep(i,b){
    res*=a;
  }
  cout<<res;
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

ll modncr(ll n,ll r){
  ll plus=1;
  rep(i,r){
    plus=(plus*(n-i))%mod;
    plus=moddevide(plus,i+1);
  }
  return plus;
}

ll modncrlistp[200000],modncrlistm[200000];

ll modncrs(ll n,ll r){
  ll i,j;
  if(modncrlistp[n]==0){
    for(i=n;i>=0;i--){
      if(modncrlistp[i])break;
    }
    if(i<0){
      modncrlistp[0]=1;
      rep1(i,n+1){
        modncrlistp[i]=(modncrlistp[i-1]*i)%mod;
      }
    }else{
      For(j,i+1,n+1){
        modncrlistp[j]=(modncrlistp[j-1]*j)%mod;
      }
    }
  }
  if(modncrlistm[n]==0){
    for(i=n;i>=0;i--){
      if(modncrlistm[i])break;
    }
    if(i<0){
      modncrlistm[0]=1;
      rep1(i,n+1){
        modncrlistm[i]=(modncrlistm[i-1]*modinv(i))%mod;
      }
    }else{
      For(j,i+1,n+1)modncrlistm[j]=(modncrlistm[j-1]*modinv(j))%mod;
    }
  }
  return (((modncrlistp[n]*modncrlistm[r])%mod)*modncrlistm[n-r])%mod;
}

ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}

vec eratosthenes(ll N){
  vec ch(N+1,1),p;
  ch[0]=ch[1]=0;
  rep(i,N+1){
    if(ch[i]){
      p.push_back(i);
      for(ll j=2;i*j<=N;j++){
        ch[i*j]=0;
      }
    }
  }
  return ch;
}
int main(){
  ll N,K,Q,x;
  cin>>N>>K>>Q;
  vec v(N,0);
  rep(i,Q){
    cin>>x;x--;
    v[x]++;
  }
  rep(i,N){
    v[i]=K+v[i]-Q;
    if(v[i]>0){
      cout<<"Yes"<<endl;
    }else{
      cout<<"No"<<endl;
    }
  }
  return 0;
}#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using vec=vector<ll>;
using mat=vector<vec>;
#define For(i,a,b) for(ll i=a;i<b;i++)
#define bFor(i,a,b) for(ll i=a;i>=b;i--)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N-1,0)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define mod 1000000007
#define endl "\n"
#define output(v) do{bool f=0;for(auto i:v){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}while(0)
using datas=pair<ll,ll>;
using tdata=pair<ll,datas>;

long mmid(long a,long b,long c){return a<b?(b<c?b:max(a,c)):(b>c?b:min(a,c));}

ll lpow(ll a,ll b){
  ll res=1;
  rep(i,b){
    res*=a;
  }
  cout<<res;
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

ll modncr(ll n,ll r){
  ll plus=1;
  rep(i,r){
    plus=(plus*(n-i))%mod;
    plus=moddevide(plus,i+1);
  }
  return plus;
}

ll modncrlistp[200000],modncrlistm[200000];

ll modncrs(ll n,ll r){
  ll i,j;
  if(modncrlistp[n]==0){
    for(i=n;i>=0;i--){
      if(modncrlistp[i])break;
    }
    if(i<0){
      modncrlistp[0]=1;
      rep1(i,n+1){
        modncrlistp[i]=(modncrlistp[i-1]*i)%mod;
      }
    }else{
      For(j,i+1,n+1){
        modncrlistp[j]=(modncrlistp[j-1]*j)%mod;
      }
    }
  }
  if(modncrlistm[n]==0){
    for(i=n;i>=0;i--){
      if(modncrlistm[i])break;
    }
    if(i<0){
      modncrlistm[0]=1;
      rep1(i,n+1){
        modncrlistm[i]=(modncrlistm[i-1]*modinv(i))%mod;
      }
    }else{
      For(j,i+1,n+1)modncrlistm[j]=(modncrlistm[j-1]*modinv(j))%mod;
    }
  }
  return (((modncrlistp[n]*modncrlistm[r])%mod)*modncrlistm[n-r])%mod;
}

ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}

vec eratosthenes(ll N){
  vec ch(N+1,1),p;
  ch[0]=ch[1]=0;
  rep(i,N+1){
    if(ch[i]){
      p.push_back(i);
      for(ll j=2;i*j<=N;j++){
        ch[i*j]=0;
      }
    }
  }
  return ch;
}
int main(){
  ll N,K,Q,x;
  cin>>N>>K>>Q;
  vec v(N,0);
  rep(i,Q){
    cin>>x;x--;
    v[x]++;
  }
  rep(i,N){
    v[i]=K+v[i]-Q;
    if(v[i]>0){
      cout<<"Yes"<<endl;
    }else{
      cout<<"No"<<endl;
    }
  }
  return 0;
}

Compiler output:
a.cc:132:2: error: stray '#' in program
  132 | }#pragma GCC optimize("Ofast")
      |  ^
a.cc: In function 'll lpow(ll, ll)':
a.cc:30:1: warning: no return statement in function returning non-void [-Wreturn-type]
   30 | }
      | ^
a.cc: At global scope:
a.cc:132:3: error: 'pragma' does not name a type; did you mean '_Pragma'?
  132 | }#pragma GCC optimize("Ofast")
      |   ^~~~~~
      |   _Pragma
a.cc:153:6: error: redefinition of 'long int mmid(long int, long int, long int)'
  153 | long mmid(long a,long b,long c){return a<b?(b<c?b:max(a,c)):(b>c?b:min(a,c));}
      |      ^~~~
a.cc:22:6: note: 'long int mmid(long int, long int, long int)' previously defined here
   22 | long mmid(long a,long b,long c){return a<b?(b<c?b:max(a,c)):(b>c?b:min(a,c));}
      |      ^~~~
a.cc:155:4: error: redefinition of 'll lpow(ll, ll)'
  155 | ll lpow(ll a,ll b){
      |    ^~~~
a.cc:24:4: note: 'll lpow(ll, ll)' previously defined here
   24 | ll lpow(ll a,ll b){
      |    ^~~~
a.cc: In function 'll lpow(ll, ll)':
a.cc:161:1: warning: no return statement in function returning non-void [-Wreturn-type]
  161 | }
      | ^
a.cc: At global scope:
a.cc:163:4: error: redefinition of 'll modinv(ll)'
  163 | ll modinv(ll a) {
      |    ^~~~~~
a.cc:32:4: note: 'll modinv(ll)' previously defined here
   32 | ll modinv(ll a) {
      |    ^~~~~~
a.cc:173:4: error: redefinition of 'll moddevide(ll, ll)'
  173 | ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}
      |    ^~~~~~~~~
a.cc:42:4: note: 'll moddevide(ll, ll)' previously defined here
   42 | ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}
      |    ^~~~~~~~~
a.cc:175:4: error: redefinition of 'll modncr(ll, ll)'
  175 | ll modncr(ll n,ll r){
      |    ^~~~~~
a.cc:44:4: note: 'll modncr(ll, ll)' previously defined here
   44 | ll modncr(ll n,ll r){
      |    ^~~~~~
a.cc:184:4: error: redefinition of 'll modncrlistp [200000]'
  184 | ll modncrlistp[200000],modncrlistm[200000];
      |    ^~~~~~~~~~~
a.cc:53:4: note: 'll modncrlistp [200000]' previously declared here
   53 | ll modncrlistp[200000],modncrlistm[200000];
      |    ^~~~~~~~~~~
a.cc:184:24: error: redefinition of 'll modncrlistm [200000]'
  184 | ll modncrlistp[200000],modncrlistm[200000];
      |                        ^~~~~~~~~~~
a.cc:53:24: note: 'll modncrlistm [200000]' previously declared here
   53 | ll modncrlistp[200000],modncrlistm[200000];
      |                        ^~~~~~~~~~~
a.cc:186:4: error: redefinition of 'll modncrs(ll, ll)'
  186 | ll modncrs(ll n,ll r){
      |    ^~~~~~~
a.cc:55:4: note: 'll modncrs(ll, ll)' previously defined here
   55 | ll modncrs(ll n,ll r){
      |    ^~~~~~~
a.cc:219:4: error: redefinition of 'll gcd(ll, ll)'
  219 | ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}
      |    ^~~
a.cc:88:4: note: 'll gcd(ll, ll)' previously defined here
   88 | ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}
      |    ^~~
a.cc:221:4: error: redefinition of 'll countdigits(ll)'
  221 | ll countdigits(ll n){
      |    ^~~~~~~~~~~
a.cc:90:4: note: 'll countdigits(ll)' previously defined here
   90 | ll countdigits(ll n){
      |    ^~~~~~~~~~~
a.cc:227:4: error: redefinition of 'll sumdigits(ll)'
  227 | ll sumdigits(ll n){
      |    ^~~~~~~~~
a.cc:96:4: note: 'll sumdigits(ll)' previously defined here
   96 | ll sumdigits(ll n){
      |    ^~~~~~~~~
a.cc:233:5: error: redefinition of 'vec eratosthenes(ll)'
  233 | vec eratosthenes(ll N){
      |     ^~~~~~~~~~~~
a.cc:102:5: note: 'vec eratosthenes(ll)' previously defined here
  102 | vec eratosthenes(ll N){
      |     ^~~~~~~~~~~~
a.cc:246:5: error: redefinition of 'int main()'
  246 | int main(){
      |     ^~~~
a.cc:115:5: note: 'int main()' previously defined here
  115 | int main(){
      |     ^~~~