There is a sorted array [1,2,…,n][1,2,\dots,n][1,2,…,n] and a permutation p1,p2,…,pnp_1,p_2,\dots,p_np1 ,p2 ,…,pn . On each round, all elements move according to the permutation: the element at ...

If you have not solved RANK problem, we advice you to take a look into that. If you have, lets move forward here. Enumerating all permutations and matching with the current one is going to be ...