Rotate right by k

Problem

Rotate a linked list to the right by k places: the last k nodes move to the front in the same order. Print the result. k may be larger than the length of the list.

Input, output and limits

Input: Line 1: integers separated by spaces. Line 2: k.
Output: The rotated list.
Constraints: 1 ≤ number of values ≤ 10000
1 ≤ each value ≤ 1000000000
0 ≤ k ≤ 1000000000

Examples

Example

Input

1 2 3 4 5
2

Output

4 5 1 2 3

Hints

Try the problem first. Open one hint at a time.

Hint 1

Count the nodes and keep the last one. Use k % length.

Hint 2

Link the last node to the head, then cut the ring at the right place.

Write your Python code, run it on the examples and submit it to hidden tests.

Solve in the editor

Sort the listhard
Reorder the listhard
Reverse in groups of khard
Where does the loop start?hard
Odd positions, then even positionsmedium

All Python problems

Problem

Input, output and limits

Examples

Hints

More Linked Lists problems

Problem

Input, output and limits

Examples

Hints

More Linked Lists problems