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

#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
#include <iostream>
#include <windows.h>
#include <deque>
using namespace std;
map<int, int> z;
int n, k, x[150005], m;
int vec[7];
int main()
{
    cin >> n >> k >> m;
    for(int i = 0; i < n; i++)
        cin >> x[i];
    if(k >= 6)
        k = 6;
    int var = 0, bel = 0, a, b;
    for(int i = 0; i < m; i++)
    {
        cin >> a >> b;
        if(a == 1)
        {
            z[x[b - 1]] = 1;
            if(var <= k)
                vec[var++] = x[b - 1];
            else
            if(x[b - 1] > vec[var]){
                vec[var] = x[b - 1];
            }
            sort(vec, vec + var, greater<int>());
        }
        if(a == 2)
        {
            if(z[x[b - 1]] == 1 && var <= k)
                cout << "YES\n";
            else
            {
                if(z[x[b - 1]] == 1 && x[b - 1] >= vec[k - 1])
                    cout << "YES\n";
                else
                    cout << "NO\n";
            }
        }
    }
}
