Given an array, reverse every sub-array formed by consecutive k elements.

**Input:**

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.

**Output:**

Corresponding to each test case, in a new line, print the modified array.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 500

1 ≤ A[i] ≤ 500

**Example:**

**Input**

1

5

1 2 3 4 5

3

**Output**

3 2 1 5 4

:p | 423 |

Anshul Wadhawan | 414 |

Calahan | 282 |

Shivam_Kumar_Singh | 232 |

singhjee | 232 |

Anshul Wadhawan | 874 |

rambo | 868 |

Calahan | 803 |

aild78 | 689 |

fullmetal27 | 685 |

akhayrutdinov | 4698 |

Ibrahim Nash | 3664 |

sanjay05 | 3633 |

Quandray | 3515 |

surbhi_7 | 2748 |