import
java.util.ArrayList;
class
GFG {
static
ArrayList<Integer> findIndices(
int
[] arr,
int
K,
int
N)
{
int
[] prefix =
new
int
[N];
int
[] suffix =
new
int
[N];
ArrayList<Integer> ans =
new
ArrayList<Integer>();
prefix[
0
] =
1
;
for
(
int
i =
1
; i < N; i++) {
if
(arr[i] <= arr[i -
1
])
prefix[i] = prefix[i -
1
] +
1
;
else
prefix[i] =
1
;
}
suffix[N -
1
] =
1
;
for
(
int
i = N -
2
; i >=
0
; i--) {
if
(arr[i] <= arr[i +
1
])
suffix[i] = suffix[i +
1
] +
1
;
else
suffix[i] =
1
;
}
for
(
int
i =
0
; i < N; i++) {
if
(K ==
0
|| i -
1
>=
0
&& i +
1
< N
&& prefix[i -
1
] >= K
&& suffix[i +
1
] >= K)
ans.add(i);
}
return
ans;
}
public
static
void
main(String args[])
{
int
[] arr = {
1
,
1
,
1
,
1
,
1
};
int
K =
0
;
int
N = arr.length;
ArrayList<Integer> ans = findIndices(arr, K, N);
for
(
int
i =
0
; i < ans.size(); i++) {
System.out.print(ans.get(i) +
" "
);
}
if
(ans.size() ==
0
)
System.out.println(
"-1"
);
}
}