1 1 1
1000000000
2 1
 20 2 15
12698951 55128070 116962690 156763505 188535242 194018601 269939893 428710623 442819431 483000923 516768937 552903993 633087286 656092270 671535141 714291344 717660646 846508634 879748146 937368929
2 7
1 2
2 4
1 19
1 12
1 5
2 18
2 11
1 16
2 1
2 3
2 19
1 17
2 9
2 6
 6 3 10
62417580 78150524 410053501 582708235 630200761 760672946
2 2
1 5
1 2
1 4
2 4
2 1
2 1
1 6
2 5
2 6

NO
 NO
NO
NO
NO
NO
NO
YES
NO
NO
 NO
YES
NO
NO
YES
YES

import java.util.*;
import java.io.*;
public class polarbear{
public static void main(String args[]) throws IOException{
BufferedReader lector = new BufferedReader(new InputStreamReader(System.in));
String t[] = lector.readLine().split(" ");
int a = Integer.parseInt(t[0]);
int b = Integer.parseInt(t[1]);
int c = Integer.parseInt(t[2]);
int nu[] =new int[a];
//int reve[] = new int[1000000001];
t = lector.readLine().split(" ");
for(int n = 0;n<a;n++){
nu[n]=-1*Integer.parseInt(t[n]);
//reve[nu[n]]=n;
}
boolean co[] = new boolean[a];
Vector<Integer> muest = new Vector<Integer>();
StringBuilder sb = new StringBuilder("");
for(int n =0;n<c;n++){
t = lector.readLine().split(" ");
int p = t[0].charAt(0)-'0';
int aa = Integer.parseInt(t[1]);
if(p==1){
muest.add(nu[aa-1]);
Collections.sort(muest);
while(muest.size()>b)muest.remove(muest.size()-1);
co[aa-1]=true;
}else{
sb.append((co[aa-1]&&muest.contains(nu[aa-1]))?"YES\n":"NO\n");
}
}
System.out.print(sb);
}
}
