An aeroplane company has developed a new plane model and wants

to test it$.$ When the team is flying a plane, they begin by collecting

data about its height at various points of time. They use this data to

create a graph of the plane's height over time. This allows them to

visualize the pattern of increase and decrease in height.

To determine the plane's maximum capabilities, they must identify

the longest time interval in which the height strictly increases,

reaches the peak height, and then strictly decreases.

Given space$-$separated positive numbers representing the

heights at which the plane is present at each point of time, write

a program to print the longest time interval in which the plane's

height strictly increases and reaches the peak height, and then

strictly decreases.