人类必须在最短的时间内迁往月球。现有n个太空站位于地球与月球之间，且有m 艘公共交通太空船在其间来回穿梭。每个太空站可容纳无限多的人，而每艘太空船i 只可容纳H[i]个人。每艘太空船将周期性地停靠一系列的太空站，例如：(1，3，4)表示该太空船将周期性地停靠太空站134134134…。每一艘太空船从一个太空站驶往任一太空站耗时均为1。人们只能在太空船停靠太空站(或月球、地球)时上、下船。初始时所有人全在地球上，太空船全在初始站。



试设计一个算法，找出让所有人尽快地全部转移到月球上的运输方案。- Human beings must in the shortest possible time to move to the moon. N of the existing station is located between Earth and the moon, and there is public transport spacecraft m vessels shuttling back and forth in the meantime. Each station can accommodate an unlimited number of people, and i each spacecraft can accommodate H [i] of individuals. Each spacecraft will periodically call a series of space station, for example: (1,3,4) that the spacecraft docking station will be periodically 134,134,134 .... Each spacecraft a space station from a time-consuming drive to any one station are 1. One can only spacecraft docked at the space station (or the moon, the Earth) when on the ship. All of the initial full-time on Earth, the spacecraft in the initial station-wide.



　　 Try to design an algorithm to find all as soon as possible so that all transferred to the moon on the transport program.