#include <bits/stdc++.h>   using namespace std;   using namespace std;   int main() {     int n, k, q;     cin >> n >> k >> q;     vector<long long> vec(n + 1);     vector<long long> pq;     map<long long, long long> ar, ans, rev;     for (int i = 1; i <= n; i++) cin >> vec[i], ar[i] = vec[i], rev[vec[i]] = i;     while (q--) {       int a, b;       cin >> a >> b;       if (a == 1) {         pq.push_back(ar[b]);         ans[b] = 1;         if (pq.size() > k) {           sort(pq.begin(), pq.end());           long long dd = rev[pq[0]];           ans[dd] = 0;           pq.erase(pq.begin());         }       } else {         if (ans[b]) {           cout <<  YES n ;         } else           cout <<  NO n ;       }     }     return 0;   }   