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 <bits/stdc++.h>
using namespace std;
long long int a[1000000];
struct node {
  int in;
  long long int t;
};
class cmp {
 public:
  bool operator()(node a, node b) {
    if (a.t < b.t)
      return true;
    else
      return false;
  }
};
int main() {
  int n, k, q, i, g, d, flag, p;
  node l;
  long long int x;
  vector<node> j;
  cin >> n >> k >> q;
  vector<node> v;
  for (i = 1; i <= n; i++) {
    cin >> x;
    a[i] = x;
    l.in = i;
    l.t = x;
    v.push_back(l);
  }
  priority_queue<node, vector<node>, cmp> qi;
  while (q--) {
    cin >> d >> g;
    if (d == 1) {
      qi.push(v[g - 1]);
    } else {
      flag = 0;
      p = 0;
      while (!qi.empty() && p < k) {
        l = qi.top();
        qi.pop();
        j.push_back(l);
        p++;
        if (l.in == g) {
          flag = 1;
          break;
        }
      }
      if (flag == 1)
        cout << "YES"
             << "\n";
      else
        cout << "NO"
             << "\n";
      for (i = 0; i < j.size(); i++) {
        qi.push(j[i]);
      }
      j.clear();
    }
  }
  return 0;
}
