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;
string ITS(long long x) {
  string s = "";
  while (x > 0) {
    s += (char)(x % 10 + '0');
    x /= 10;
  }
  string t = "";
  for (int i = s.size() - 1; i > -1; i--) t += s[i];
  return t;
}
long long inf = 1e9;
long long mod = 1e9 + 7;
const long long M = 2e5;
pair<long long, long long> online[M];
long long t[M];
int main() {
  cin.sync_with_stdio(false);
  long long n, k, q;
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> t[i];
  for (int i = 0; i < q; i++) {
    long long qt, qid;
    cin >> qt >> qid;
    if (qt == 1) {
      sort(online, online + k);
      if (t[qid] > online[0].first) {
        online[0].first = t[qid];
        online[0].second = qid;
      }
    } else {
      long long i;
      for (i = 0; i < k; i++)
        if (online[i].second == qid) {
          cout << "YES\n";
          break;
        }
      if (i == k) cout << "NO\n";
    }
  }
}
