#include <string>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> solution(vector<int> array, vector<vector<int>> commands) {
    vector<int> answer;
    int len = commands.size();
    int i, j, k;
    vector<int> save;
    for(int a = 0; a<len; a++){
        i = commands.at(a).at(0);
        j = commands.at(a).at(1);
        k = commands.at(a).at(2);
        
        for(int b = i-1; b<j;b++){
            save.push_back(array.at(b));
        }
        sort(save.begin(), save.end());
        answer.push_back(save.at(k-1));
        save.clear();
    }
    return answer;
}