PAT1014

Suppose a bank has N windows open for service.

一个银行有N个服务的窗口

There is a yellow line in front of the windows which devides the waiting area into two parts.

在每一个窗口前面都一根黄线用来划分等待区的两个部分

The rules for the customers to wait in line are:

对于顾客来讲等待线的规则是这样的

• The space inside the yellow line in front of each window is enough to contain a line with M customers.

在每一个窗口前面的黄线之内可以包含M个顾客

Hence when all the N lines are full, all the customers after (and including) the (NM+1)st one will have to wait in a line behind the yellow line.

所以，当全部N条线，全部的顾客中第N*M+1位顾客必须在黄线后等待

• Each customer will choose the shortest line to wait in when crossing the yellow line.

当越过黄线以后，每一个顾客将会选择最短的队伍去等待。

If there are two or more lines with the same length, the customer will always choose the window with the smallest number.

若是有两个或者更多的一样长度的队伍，顾客会老是会选择更小编号的队伍。

• Customer[i] will take T[i] minutes to have his/her transaction processed.

顾客i将会花费Ti分钟处理本身的交易流程

• The first N customers are assumed to be served at 8:00am.

前面N个顾客假定从早上8点开始被服务

Now given the processing time of each customer, you are supposed to tell the exact time at which a customer has his/her business done.

如今给出每一个顾客的交易时间，要求你求出每一个顾客完成业务的准确时间

For example, suppose that a bank has 2 windows and each window may have 2 custmers waiting inside the yellow line.

例如，一个银行有两个窗口，每一个一个窗口能有两个顾客等在黄线内

There are 5 customers waiting with transactions taking 1, 2, 6, 4 and 3 minutes, respectively.

如今我5位顾客，花费的时间分别是12643

At 08:00 in the morning, customer₁ is served at window₁ while customer₂ is served at window₂.

在早上8点，顾客1在窗口1，顾客2在窗口2

Customer₃ will wait in front of window₁ and customer₄ will wait in front of window₂.

顾客3等在窗口1，顾客4等在窗口2

Customer₅ will wait behind the yellow line.

顾客5等在黄线后

At 08:01, customer₁ is done and customer₅ enters the line in front of window₁ since that line seems shorter now.

8点01分，顾客1完成了，顾客5进入线内，到了队伍最短的窗口1

Customer₂ will leave at 08:02, customer₄ at 08:06, customer₃ at 08:07, and finally customer₅ at 08:10.

顾客2,在8点02离开，顾客4.。。。。。。。

Input

Each input file contains one test case. Each case starts with a line containing 4 positive integers: N (<=20, number of windows), M (<=10, the maximum capacity of each line inside the yellow line), K (<=1000, number of customers), and Q (<=1000, number of customer queries).

每一个输入文件包含一个测试用例，每一个测试用例由4个整数开始，N, M, K, Q

The next line contains K positive integers, which are the processing time of the K customers.

下面K个正整数表示K顾客花费的时间

The last line contains Q positive integers, which represent the customers who are asking about the time they can have their transactions done. The customers are numbered from 1 to K.

最后一行Q个整数，表明那些想要询问他们想要询问他们到底花费了多少时间的人。顾客的编号从1到K

Output

For each of the Q customers, print in one line the time at which his/her transaction is finished, in the format HH:MM where HH is in [08, 17] and MM is in [00, 59]. Note that since the bank is closed everyday after 17:00, for those customers who cannot be served before 17:00, you must output "Sorry" instead.

对于q个顾客，打印一行时间，他完成的时间，格式是HH:MM，HH是08-17，MM是00-59。记住银行天天17：00关门，对于那些不能再17:00完成的业务的，你须要输出soory

Sample Input

2 2 7 5
1 2 6 4 3 534 2
3 4 5 6 7

Sample Output

08:07
08:06
08:10
17:00
Sorry

题目的意思已经很明显了，银行排队，已经很明显了，数据结构用队列就好了，每一个窗口一个队列，而后到时间了完成了出队，然入队，主要考验模拟时的逻辑能力。用queue会简单一些。