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;
class doue {
 public:
  int a;
  bool check = false;
  doue(int x) : a(x){};
};
int main() {
  int n, *id1, k, q, type, itsID = 0;
  map<int, doue> id;
  cin >> n >> k >> q;
  cin.ignore();
  id1 = new int[n];
  auto it = id.begin();
  for (int i = 0; i < n; i++) {
    cin >> id1[i];
    id.insert(pair<int, doue>(id1[i], doue(i + 1)));
  }
  for (int i = 0; i < q; i++) {
    cin >> type >> itsID;
    cin.ignore();
    it = id.end();
    if (type == 1) {
      for (int j = 0; j < n; j++, it++) {
        if (it->second.a == itsID) {
          it->second.check = true;
        }
      }
    } else if (type == 2) {
      for (int j = 0; j < k; j++, --it) {
        if (it->second.a == itsID && it->second.check == true) {
          cout << "YES" << endl;
          break;
        } else if (j == n - 1) {
          cout << "NO" << endl;
          break;
        }
      }
    }
  }
}
