利用队列结构实现车厢重排问题。车厢重排问题如下：

一列货车共有n节车厢，每个车厢都有自己的编号，编号范围从1~n。给定任意次序的车厢，通过转轨站将车厢编号按顺序重新排成1~n。转轨站共有k个缓冲轨，缓冲轨位于入轨和出轨之间。开始时，车厢从入轨进入缓冲轨，经过缓冲轨的重排后，按1~n的顺序进入出轨。缓冲轨按照先进先出方式，编写一个算法，将任意次序的车厢进行重排，输出每个缓冲轨中的车厢编号。

-Queue structure compartment rearrangement. Compartment rearrangement as follows: a freight train and rode a total of n cars, each compartment has its own number, the number ranging from 1 to n-. Given the carriage of any order through the transition station the carriage number in order for rearrangement 1 ~~ n. Transition station k-buffer rail buffering rail located between the orbit and the derailment. The beginning of the compartment from the orbit into the buffer rail, after a rearrangement of the buffer track, according to the order of 1 ~ n into the derailment. Buffer rail in accordance with the FIFO manner, the preparation of an algorithm, in any order of the compartment rearrangement, the output of each buffer rail carriage number.