Uchiha Clan

One day itachi is playing with an array. He has an array $a$ of size $N$. He is interested in finding 2 integer $k$,$l$. Such that it should satify the following condition: -> 1<=$k$<$l$<=$N$. -> Maximum element of subarray from a[1] to a[k]=Maximum element from a[l] to a[n]=Minimum element from a[k+1] to a[l-1] Help itachi in doing this problem.If there does not exist any such $k$,