Problem Description

Simulate a circular queue rotation k times. After each rotation, the front element moves to the back. Report the front element after each rotation.

Input Format

First line: n k (queue size, rotations). Second line: n space-separated integers (initial queue).

Output Format

k lines, each showing the front element after that rotation.

Constraints

• 1 ≤ n ≤ 1000

• 1 ≤ k ≤ 1000

• -1000 ≤ queue elements ≤ 1000

• Rotation moves front element to back

• Report front element after each rotation

Sample Input/Output

Explanation

Initial: [1,2,3,4]. After rotation 1: [2,3,4,1], front=2. After rotation 2: [3,4,1,2], front=3. After rotation 3: [4,1,2,3], front=4.