#include <bits/stdc++.h>
using namespace std;
int a[155000];
int s[10];
int main() {
  int n, m, k;
  a[153000] = -1;
  scanf("%d%d%d", &n, &k, &m);
  for (int i = 0; i < k; i++) s[i] = 153000;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int ta, tb;
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &ta, &tb);
    if (ta == 1) {
      int mn = 0x3f3f3f3f, mi;
      for (int j = 0; j < k; j++) {
        if (a[s[j]] < mn) {
          mn = a[s[j]];
          mi = j;
        }
      }
      if (a[s[mi]] >= a[tb])
        continue;
      else
        s[mi] = tb;
    } else if (ta == 2) {
      int j;
      for (j = 0; j < k; j++) {
        if (s[j] == tb) {
          printf("YES\n");
          break;
        }
      }
      if (j == k) printf("NO\n");
    }
  }
}
