#include <iostream>
#include <string>
#include <vector>
using namespace std;
int partition(vector<int> v,int low, int high)
{
int pivot = low;
int L = low-1;
int R = high;
if(L < R)
{
while(v[pivot] < v[L] && L<R) L++;
while(v[pivot] >= v[R] && L<R) R--;
if(L < R)
{
int temp = v[L];
v[L]=v[R];
v[R]=temp;
}
if(v[pivot] > v[R])
{
int temp = v[pivot];
v[pivot] = v[R];
v[R] = temp;
}
}
return R;
}
void quickSort(vector<int> v,int left,int right)
{
if(left < right)
{
int pivot = partition(v,left,right);
partition(v,left,pivot-1);
partition(v,pivot,right);
}
}
vector<int> solution(vector<int> array, vector<vector<int> > commands) {
quickSort(array,commands[0][0],commands[0][1]);
vector<int> answer;
return answer;
}
int main() {
vector<int> v;
vector<int> v1;
vector<int> v2;
vector<int> v3;
vector< vector<int> > vv;
v.push_back(1);
v.push_back(5);
v.push_back(2);
v.push_back(6);
v.push_back(3);
v.push_back(7);
v.push_back(4);
v1.push_back(2);
v1.push_back(5);
v1.push_back(3);
v2.push_back(4);
v2.push_back(4);
v2.push_back(1);
v2.push_back(1);
v2.push_back(7);
v2.push_back(3);
vv.push_back(v1);
vv.push_back(v2);
vv.push_back(v3);
vector<int> result = solution(v, vv);
for(int i=0; i<result.size(); i++)
{
cout<<result[i]<<' ';
}
}