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

/*
	Author : Amar Prakash Pandey
	contact : http://amarpandey.me
*/
#include <string.h>
#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <math.h>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stdio.h>
#include <stack>
#include <algorithm>
#include <list>
#include <ctime>
#include <memory.h>
#include <ctime>
#include <assert.h>
#define pi 3.14159
#define mod 1000000007
#define rep(i,a,n) for (int i=a;i<=n;i++)
using namespace std;

struct array {
	int x,y;
};

bool compare(array a, array b) {
	return a.x < b.x;
}


long long int t[150000]={0};
int awake[150000]={0};
array d[10];

int main() {
  long long int n, k, q, flag = 0;
  long long int i, a, b, cont=0;
  cin >> n >> k >> q;
  if (k > n) {k = n;}
  rep(i,1,n) {
    cin >>t[i];
  }
  while(q--) {
    flag = 0;
    cin >> a >> b;
    if(a == 1) {
      awake[b] = 1;
      if(cont < k) {
        d[cont].x = t[b];
        d[cont].y = b;
        cont=0;
        sort(d, d+k, compare);
      } else {
        if(d[0].x < t[b]) {
          d[0].x = t[b];
          d[0].y = b;
          sort(d, d+k, compare);
        }
      }
    } else {
      if(awake[b] == 1) {
        for(i=0;i<k;i++) {
          if(b == d[i].y) {
            flag = 1;
            break;
          }
        }
        if(flag == 1) {cout <<"YES"<<endl;}
        else {cout <<"NO"<<endl;}
      } else {
        cout << "NO"<<endl;
      }
    }
    // for(i=0;i<k;i++) {
    //   cout << d[i].x << "   ";
    // }
  }
	return 0;
}
