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;
int n, k, q, t[156789], s[156789], a[10], cur = 0;
int main() {
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> t[i];
  for (int i = 1; i <= n; i++) s[i] = 0;
  while (q--) {
    int x, y;
    cin >> x >> y;
    if (x == 1) {
      if (cur < k) {
        cur++;
        a[cur] = y;
        s[y] = 1;
      } else {
        int check = 0;
        for (int i = 1; i <= cur; i++)
          if (t[y] > t[a[i]]) check++;
        if (check) {
          int m = -1, v = (int)1e9 + 1;
          for (int i = 1; i <= cur; i++)
            if (t[a[i]] < v) {
              m = i;
              v = t[a[i]];
            }
          s[a[m]] = 0;
          a[m] = y;
          s[y] = 1;
        }
      }
    } else {
      if (s[y])
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
