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.*;

public class Main {
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int q = sc.nextInt();
        int[] nums = new int[n];
        for(int i = 0; i < n; i++)
        {
            nums[i] = sc.nextInt();
        }
        TreeSet<Integer> bois = new TreeSet<Integer>();
        for(int i = 0; i < q; i++)
        {
            int id = sc.nextInt();
            int elem = sc.nextInt();
            if(id == 1)
            {
                bois.add(nums[elem - 1]);
                if(bois.size() > k)
                    bois.pollFirst();
            }
            else
            {
                if(bois.contains(nums[elem - 1]))
                    System.out.println("YES");
                else
                    System.out.println("NO");
            }
        }
        
    }
}