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 cel(long long x, long long y) {
  if (x % y == 0) return x / y;
  return x / y + 1;
}
long long POW(long long x, long long y) {
  if (y == 0) return 1;
  if (y == 1) return x;
  long long ans = POW(x, y / 2);
  ans *= ans;
  if (y % 2 == 0) return ans;
  return ans * x;
}
const int MX = 3e5 + 9;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
int n, q, t[MX], k, type, id;
set<pair<int, int> > s;
string ans[MX];
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &t[i]);
  }
  for (int i = 1; i <= n; i++) ans[i] = "NO";
  while (q--) {
    scanf("%d%d", &type, &id);
    if (type == 2) {
      cout << ans[id] << endl;
      continue;
    }
    if (s.size() < k) {
      s.insert({t[id], id});
      ans[id] = "YES";
      continue;
    }
    if (t[id] > s.begin()->first) {
      ans[s.begin()->second] = "NO";
      s.erase(s.begin());
      s.insert({t[id], id});
      ans[id] = "YES";
    }
  }
}
