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 gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * (b / (gcd(a, b))); }
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
inline long long toLL(string s) {
  long long v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
using namespace std;
using namespace std;
int n, q, k;
long long t[1500000 + 5];
vector<pair<int, int> > online;
vector<pair<int, int> > tmp;
void set_online(int id) {
  tmp.clear();
  online.push_back(make_pair(t[id], id));
  sort(((online).begin()), ((online).end()));
  int sz = ((int)((online).size()));
  int cnt = k;
  for (int i = sz - 1; i >= 0; i--) {
    if (cnt == 0) break;
    tmp.push_back(online[i]);
    cnt--;
  }
  online.clear();
  for (int k = 0; k < ((int)((tmp).size())); k++) online.push_back(tmp[k]);
}
void check_online(int id) {
  for (int k = 0; k < ((int)((online).size())); k++) {
    if (online[k].second == id) {
      cout << "YES"
           << "\n";
      return;
    }
  }
  cout << "NO"
       << "\n";
  ;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) cin >> t[i];
  int type = 0;
  int id = 0;
  while (q--) {
    cin >> type >> id;
    if (type == 1)
      set_online(id);
    else
      check_online(id);
  }
}
