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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class P658B
{
	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int friends = Integer.parseInt(st.nextToken());
		int max = Integer.parseInt(st.nextToken());
		int queries = Integer.parseInt(st.nextToken());
		
		int[] relation = new int[friends];
		st = new StringTokenizer(br.readLine());
		for (int i = 0; i < friends; i++)
			relation[i] = Integer.parseInt(st.nextToken());
		
		TreeSet<Query> set = new TreeSet<Query>();
		for (int i = 1; i <= queries; i++)
		{
			st = new StringTokenizer(br.readLine());
			int type = Integer.parseInt(st.nextToken());
			int ind = Integer.parseInt(st.nextToken())-1;
			int rel = relation[ind];
			Query q = new Query(rel);
			if (type == 1)
			{
				set.add(q);
				if (set.size() > max)
					set.remove(set.last());
			}
			else //type 2
			{
				if (set.contains(q))
					System.out.println("YES");
				else
					System.out.println("NO");
			}
		}
		
		br.close();
	}
}

class Query implements Comparable<Query>
{
	int relation;
	public Query(int rel)
	{
		this.relation = rel;
	}
	public boolean equals(Query q)
	{
		return this.relation == q.relation;
	}
	@Override
	public int compareTo(Query q)
	{
		return q.relation - this.relation;
	}

}