func_code_string: #include <bits/stdc++.h>   using namespace std;   long long n, k, q, a, b, x, y, i = 1, j, p[150000], mas[150005];   pair<int, int> m[10];   int main() {     cin >> n >> k >> q;     while (i <= n) {       cin >> p[i];       i++;     }     i = 0;     while (i < q) {       cin >> a >> b;       if (a == 1) {         if (p[b] > m[k - 1].first) {           mas[m[k - 1].second] = 0;           mas[b] = 1;           m[k - 1].first = p[b];           m[k - 1].second = b;           sort(m, m + k);           reverse(m, m + k);         }       }       if (a == 2) {         if (mas[b] == 0) {           cout <<  NO  << endl;         } else {           cout <<  YES  << endl;         }       }       i++;     }   }   