Ankit And His Array

Ankit has an array a1,a2,…,an of n positive integers. He will do the following operation to this array exactly once: Pick a subsegment of this array and cyclically rotate it by any amount. Formally, he can do the following exactly once: Pick two integers l and r, such that 1≤l≤r≤n, and any positive integer k. Repeat this k times: set al=al+1,al+1=al+2,…,ar−1=ar,ar=al (all changes happen at the sa