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 main() {
  long long arr[100000], i, j, n, m, k, l = 6, t, t1;
  cin >> n >> m >> k;
  map<long long, long long> mp, mp1, mp2;
  deque<int> q;
  for (i = 1; i <= n; i++) {
    cin >> arr[i];
    mp1[arr[i]] = i;
  }
  m = min(m, l);
  while (k--) {
    cin >> t >> t1;
    if (t == 1) {
      if (q.size() == m) {
        mp[t1] = 1;
        q.push_back(arr[t1]);
        sort(q.begin(), q.end());
        cout << "--------" << mp1[q.front()] << endl;
        mp[mp1[q.front()]] = 0;
        q.pop_front();
      } else {
        q.push_back(arr[t1]);
        mp[t1] = 1;
      }
    } else {
      if (mp[t1] == 0)
        puts("NO");
      else if (mp[t1] == 1)
        puts("YES");
    }
  }
}
