|All-time Popular Problems|
|Construct Tree from Inorder & Preorder|
|Sum of two large numbers|
|Level order traversal in spiral form|
|Spirally traversing a matrix|
|Angle between hour and minute hand|
|Binary Tree to DLL|
|Smallest Positive missing number|
|Height of Binary Tree|
|Largest Number formed from an Array|
Given an array, reverse every sub-array formed by consecutive k elements.
The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consist of two lines. The first line of each test case consists of an integer N, where N is the size of array.The second line of each test case contains N space separated integers denoting array elements.The third line of each test case consists of an integer K.
Corresponding to each test case, in a new line, print the modified array.
1 ≤ T ≤ 100
1 ≤ N ≤ 500
1 ≤ A[i] ≤ 500
1 2 3 4 5
3 2 1 5 4