题目描述 Given a singly linked list $L 1 \rightarrow L 2 \rightarrow \cdots \rightarrow L {n-1} \rightarrow L n$ and an integer $1 \leq k < n$, you are supposed to rearrange the links to obtain a list like $L k \rightarrow L n \rightarrow L {k-1} \rightarrow L {n-1} \rightarrow \cdots$. For example, given $L$ being $1 \rightarrow 2 \rightarrow 3 \rightarrow 4 \rightarrow 5 \rightarrow 6$ and $k=4$, you must output $4 \rightarrow 6 \rightarrow 3 \rightarrow 5 \rightarrow 2 \rightarrow 1$. 输入格式 Each input file contains one test case. For each case, the first line contains the address of the first node, a positive $N$ $(\leq 10^5)$ which is the total number of nodes, and an integer $1 \leq k < n$ where $n$ is the number of nodes in the linked list. 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 there are at least two nodes on the list. 输出格式 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. 输入样例 00100 6 4 00000 4 99999 00100 1 12309 68237 6 -1 33218 3 00000 99999 5 68237 12309 2 33218 输出样例 00000 4 68237 68237 6 33218 33218 3 99999 99999 5 12309 12309 2 00100 00100 1 -1