Given a linked list of size N and a key, your task is to complete the function insertInMiddle(), that should insert the key in the middle of the linked list.

Input:
The function takes two argument as input, the reference pointer to the head of the linked list and an integer value key, the data to be inserted in the linked list.
There will be T, test cases and for each test case the function will be called separately.

Output:
For each test case the function should return the reference pointer to the head of the linked list.

Constraints:
1<=T<=100
1<=N<=103

Example:
Input:
2
3
1 2 4
3
4
10 20 40 50
30
Output:
1 2 3 4
10 20 30 40 50

Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

** For More Input/Output Examples Use 'Expected Output' option **