Given a linked list, you are asked to reverse chunks of length l in the linked list from the very beginning to the very end until there are no chunks left.
Input
The initial data for the linked list is obtained automatically. You don’t need to do anything.
The next line contains a single integer l (1 ≤ l ≤ |L|) the length of the chunks.