#include #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define all(v) v.begin(), v.end() using namespace std; using lint = long long; using vli = vector; int main() { int n, k, q; cin >> n >> k >> q; vli a(n); rep(i, n) { cin >> a[i]; } rep(i, q) { vli query(2); cin >> query[0]; if (query[0] == 1) { cin >> query[1]; a.push_back(query[1]); } else if (query[0] == 2) { cin >> query[1]; sort(all(a)); a[k - 1] += query[1]; } else { sort(all(a)); cout << a[k - 1] << endl; } } }