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

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

-Compartments use the queue structure to achieve the rearrangement problem. Rearrangement inside the following: a freight train and rode a total of n cars, each car has its own number, number range from 1 ~ n. The cars in any order given by the transition points will be re-arranged in order inside number 1 ~ n. Transition rail stations a total of k-buffer, the buffer between the rail in the orbit and the derailment. Initially, rail cars into the buffer from the orbit, after the rearrangement of the buffer track, press 1 ~ n the order into the derailment. Rail in accordance with the FIFO buffer mode, write an algorithm for arbitrary rearrangement of the order of the cars, the output of each track in the buffer compartment number.