PROGRAMMING:Merging Linked Lists
Given two singly linked lists $$L_ 1 = a_ 1 \to a_ 2\to \cdots \to a_{ n-1}\to a_ n$$ and $$L_ 2 = b_ 1 \to b_ 2\to \cdots \to b_{ m-1}\to b_ m$$. If $$n\ge 2m$$, you are supposed to reverse and merge the shorter one into the longer one to obtain a list like $$a_ 1 \to a_ 2 \to b_{ m} \to a_ 3 \to a_ 4 \to b_{ m-1}\cdots $$. For example, given one list being 6→7 and the other one 1→2→3→4→5, you must output 1→2→7→3→4→6→5.
### Input Specification:
Each input file contains one test case. For each case, the first line contains the two addresses of the first nodes of $$L_ 1$$ and $$L_ 2$$, plus a positive $$N$$ ($$\le 10^5$$) which is the total number of nodes given. The address of a node is a 5-digit nonnegative integer, and NULL is represented by `-1`.
Then $$N$$ lines follow, each describes a node in the format:
```
Address Data Next
```
where `Address` is the position of the node, `Data` is a positive integer no more than $$10^5$$, and `Next` is the position of the next node. It is guaranteed that no list is empty, and the longer list is at least twice as long as the shorter one.
### Output Specification:
For each case, output in order the resulting linked list. Each node occupies a line, and is printed in the same format as in the input.
### Sample Input:
```in
00100 01000 7
02233 2 34891
00100 6 00001
34891 3 10086
01000 1 02233
00033 5 -1
10086 4 00033
00001 7 -1
```
### Sample Output:
```out
01000 1 02233
02233 2 00001
00001 7 34891
34891 3 10086
10086 4 00100
00100 6 00033
00033 5 -1
```
answer：If there is no answer, please comment
### Input Specification:
Each input file contains one test case. For each case, the first line contains the two addresses of the first nodes of $$L_ 1$$ and $$L_ 2$$, plus a positive $$N$$ ($$\le 10^5$$) which is the total number of nodes given. The address of a node is a 5-digit nonnegative integer, and NULL is represented by `-1`.
Then $$N$$ lines follow, each describes a node in the format:
```
Address Data Next
```
where `Address` is the position of the node, `Data` is a positive integer no more than $$10^5$$, and `Next` is the position of the next node. It is guaranteed that no list is empty, and the longer list is at least twice as long as the shorter one.
### Output Specification:
For each case, output in order the resulting linked list. Each node occupies a line, and is printed in the same format as in the input.
### Sample Input:
```in
00100 01000 7
02233 2 34891
00100 6 00001
34891 3 10086
01000 1 02233
00033 5 -1
10086 4 00033
00001 7 -1
```
### Sample Output:
```out
01000 1 02233
02233 2 00001
00001 7 34891
34891 3 10086
10086 4 00100
00100 6 00033
00033 5 -1
```
answer：If there is no answer, please comment