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>
unsigned long long mulmod(unsigned long long a, unsigned long long b,
                          unsigned long long c) {
  unsigned long long x = 0, y = a % c;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x + y) % c;
    }
    y = (y * 2) % c;
    b /= 2;
  }
  return x % c;
}
unsigned long long pow(unsigned long long a, unsigned long long b,
                       unsigned long long c) {
  unsigned long long x = 1, y = a;
  while (b > 0) {
    if (b & 1) x = mulmod(x, y, c);
    y = mulmod(y, y, c);
    b >>= 1;
  }
  return x;
}
bool Miller(unsigned long long p, int iteration) {
  if (p < 2) {
    return false;
  }
  if (p != 2 && p % 2 == 0) {
    return false;
  }
  unsigned long long second = p - 1;
  while (second % 2 == 0) {
    second /= 2;
  }
  for (int i = 0; i < iteration; i++) {
    unsigned long long a = rand() % (p - 1) + 1, temp = second;
    unsigned long long mod = pow(a, temp, p);
    while (temp != p - 1 && mod != 1 && mod != p - 1) {
      mod = mulmod(mod, mod, p);
      temp *= 2;
    }
    if (mod != p - 1 && temp % 2 == 0) {
      return false;
    }
  }
  return true;
}
using namespace std;
int main() {
  int n, k, q;
  scanf("%d", &n);
  scanf("%d", &k);
  scanf("%d", &q);
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  set<int> second;
  for (int i = 0; i < q; i++) {
    int ch;
    scanf("%d", &ch);
    int id;
    scanf("%d", &id);
    if (ch == 1) {
      second.insert(a[id - 1]);
      if (second.size() > k) second.erase(second.begin());
    } else {
      if (second.find(a[id - 1]) != second.end()) {
        cout << "YES\n";
      } else {
        cout << "NO\n";
      }
    }
  }
  return 0;
}
