#include <bits/stdc++.h>   using namespace std;   const int MAX_N = 150001;   int t[MAX_N];   int main() {     int n, k, q;     cin >> n >> k >> q;     for (int i = 0; i < n; ++i) {       cin >> t[i];     }     set<int> s;     for (int i = 0; i < q; ++i) {       int x, y;       cin >> x >> y;       if (x == 1) {         s.insert(-t[y - 1]);         if (s.size() > k) {           auto it = s.begin();           for (int j = 0; j < k; ++j) it++;           s.erase(it);         }       } else {         cout << (s.find(-t[y - 1]) == s.end() ?  NO  :  YES ) << endl;       }     }     return 0;   }   