class Solution {
public int[] solution(int[] arr, int[][] queries) {
int[] answer = new int[queries.length];
for (int i = 0; i < queries.length; i++) {
int s = queries[i][0];
int e = queries[i][1];
int k = queries[i][2];
int min = Integer.MAX_VALUE;
boolean check = false;
for (int j = s; j < e+1 ; j++) {
if (arr[j] > k) {
min = Math.min(min, arr[j]);
check = true;
}
}
if(check){
answer[i] = min;
}else{
answer[i] = -1;
}
}
return answer;
}
}