Given a linked list, write a program to reverse every k nodes. If a linked list is given as 1->2->3->4->5->6->7->8->NULL and k = 3 then output will be 3->2->1->6->5->4->8->7->NULL.

Input:

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains three lines. The first line of each test case contains an integer N. Then in the next line are N space separated values of the linked list. Last line contains value K.

Output:

Reverse the linked list in the group of given size and print the modified linked list.

Constraints:
1 <=T<= 50
1 <=n<= 100000
1 <=k<=10000