##### Submissions: 21443   Accuracy: 49.26%   Difficulty: Easy   Marks: 2
Associated Course(s):   Interview Preparation

Given two linked lists of size N which is sorted in ascending order. Merge them in-place and return head of the merged list.

Note: It is strongly recommended to do merging in-place using O(1) extra space.

Input:
First line of input contains number of testcases T. For each testcase, first line of input contains N and M, and next two line contains sorted lists of size N and M.

Output:
For each testcase, print the merged list in sorted form.

The task is to complete the function SortedMerge() which takes references to the heads of two linked lists as the arguments and returns the head of merged linked list.

Constraints:
1 <= T <= 200
1 <= N, M <= 103
1 <= Node's data <= 103

Example:
Input:

2
4 3
5 10 15 40
2 3 20
2 2
1 1
2 4

Output:
2 3 5 10 1
5 20 40
1 1 2 4

Explanation:
Testcase 1:
After merging the two linked lists, we have merged list as 2, 3, 5, 10, 15, 20, 40.

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

Contributor: Amit Khandelwal
Author: kartik