Given a sorted array of numbers, value K and an index X in array, find the K closest numbers in position to X in array.

Example: Let array be 11 23 24 75 89, X be 24 and K be 2. Now we have to find K numbers closest to X that is 24. In this example, 23 and 75 are the closest 2 numbers to 24.

**Note: **K should be even and in cases with less than k/2 elements on left side or right side, we need to print other side elements. Like 2 4 5 6 7, X be 6 and K be 4 then answer is 2 4 5 7

**Input:**

The first line of input contains an integer T denoting the number of test cases.

The first line of each test case is N,N is the size of array.

The second line of each test case contains N input C[i].

The third line of each test case contains K and X.

**Output:**

Print K closest number in position to X in array.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 100

1 ≤ C[i] ≤ 1000

**Example:**

Input

1

5

11 23 24 75 89

2 24

Output

23 75

DhruvKulshreshtha | 102 |

Radhaakrishna | 64 |

Mr_Bean | 58 |

Rishabh Jain 32 | 58 |

PRATEEK JAIN 16 | 57 |

Mr_Bean | 783 |

Dhirendra121 | 462 |

kinetic | 360 |

kevinyu102589 | 358 |

Guru_console | 330 |

akhayrutdinov | 4926 |

Ibrahim Nash | 4448 |

Quandray | 4261 |

sanjay05 | 3668 |

GB11 | 2857 |

Login to report an issue on this page.