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;
const long long linf = 10000000000000043LL;
const int inf = 1000000043;
template <class T>
inline const T sqr(const T& x) {
  return x * x;
}
unsigned long long powi(unsigned long long a, unsigned long long b,
                        long long mod = 1000000007) {
  if (b < 2) return b ? a : 1;
  return (powi((a * a) % mod, b / 2, mod) * (b % 2 ? a : 1LL)) % mod;
}
template <class T>
inline bool maxz(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool minz(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool maxze(T& a, T b) {
  if (a <= b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool minze(T& a, T b) {
  if (a >= b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& cout, const pair<T1, T2>& a) {
  cout << "(";
  if (a.first < 10) cout << " ";
  cout << a.first << "; ";
  if (a.second < 10) cout << " ";
  cout << a.second;
  return cout << ")";
}
template <class T>
ostream& operator<<(ostream& cout, const vector<T>& a) {
  cout << "{ ";
  for (int i = 0; i < (a.size()); i++)
    cout << a[i] << (i == a.size() - 1 ? "" : "; ");
  return cout << "}" << endl;
}
void Solve();
int main() {
  ios::sync_with_stdio(false);
  Solve();
  return 0;
}
void Solve() {
  long long n, k, q;
  cin >> n >> k >> q;
  vector<long long> a(n);
  for (int i = 0; i < (n); i++) cin >> a[i];
  set<long long> on;
  for (int i = 0; i < (q); i++) {
    int t, id;
    cin >> t >> id;
    id--;
    if (t == 1) {
      on.insert(a[id]);
      if (on.size() > k) on.erase(on.begin());
    } else {
      if (on.find(a[id]) == on.end()) {
        cout << "NO" << endl;
      } else {
        cout << "YES" << endl;
      }
    }
  }
}
