Problem:
Problem B: Restaurant

Steve runs a small restaurant in a city. Also, as he is the only cook in his restaurant, he cooks everything
ordered by customers.

Basically he attends to orders by first-come-first-served principle. He takes some prescribed time to
prepare each dish. As a customer can order more than one dish at a time, Steve starts his cooking with
the dish that takes the longest time to prepare. In case that there are two or more dishes that take
the same amount of time to prepare, he makes these dishes in the sequence as listed in the menu card
of his restaurant. Note that he does not care in which order these dishes have been ordered. When he
completes all dishes ordered by a customer, he immediately passes these dishes to the waitress and has
them served to the customer. Time for serving is negligible.

On the other hand, during his cooking for someone’s order, another customer may come and order dishes.
For his efficiency, he decided to prepare together multiple dishes of the same if possible. When he starts
cooking for new dishes, he looks over the orders accepted by that time (including the order accepted
exactly at that time if any), and counts the number of the same dishes he is going to cook next. Time
required for cooking is the same no matter how many dishes he prepare at once. Unfortunately, he has
only limited capacity in the kitchen, and hence it is sometimes impossible that the requested number of
dishes are prepared at once. In such cases, he just prepares as many dishes as possible.

Your task is to write a program that simulates the restaurant. Given a list of dishes in the menu card
and orders from customers with their accepted times, your program should output a list of times when
each customer is served.

Input

The input contains multiple data sets. Each data set is in the format below:

N M
Name1 Limit1 Time1
...
NameN LimitN TimeN
T1 K1 Dish1,1 . . . Dish1,K1
...
TM KM DishM,1 . . . DishM,KM

Here, N (1 ≤ N ≤ 20) and M (1 ≤ M ≤ 100) specify the number of entries in the menu card and the
number of orders that Steve will receive, respectively; each Namei is the name of a dish of the i-th entry
in the menu card, which consists of up to 20 alphabetical letters; Limiti (1 ≤ Limiti ≤ 10) is the number of dishes he can prepare at the same time; Timei (1 ≤ Timei ≤ 1000) is time required to prepare a dish
(or dishes) of the i-th entry; Tj (1 ≤ Tj ≤ 10000000) is the time when the j-th order is accepted; Kj
(1 ≤ Kj ≤ 10) is the number of dishes in the j-th order; and each Dishj,k represents a dish in the j-th
order.

You may assume that every dish in the orders is listed in the menu card, but you should note that each
order may contain multiple occurrences of the same dishes. The orders are given in ascending order by
Tj , and no two orders are accepted at the same time.

The input is terminated with a line that contains two zeros. This is not part of data sets and hence
should not be processed.

Output

Your program should produce the output of M -lines for each data set. The i-th line of the output should
contain a single integer that indicates the time when the i-th order will be completed and served to the
customer.

Print a blank line between two successive data sets.

Sample Input

5 4
Ramen 3 10
Chahan 5 5
Gyoza 5 10
Rice 1 1
Soup 1 1
5 2 Ramen Gyoza
10 6 Chahan Gyoza Soup Ramen Gyoza Rice
20 1 Chahan
25 1 Ramen
0 0

Output for the Sample Input

25
42
40
35

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;

//Restaurant
public class Main{

	class R implements Comparable<R>{
		int oid, id;
		public R(int oid, int id) {
			this.oid = oid;
			this.id = id;
		}
		public int compareTo(R o) {
			return oid!=o.oid?oid-o.oid:p[id]!=p[o.id]?p[o.id]-p[id]:id-o.id;
		}
	}

	int n, m;
	int[] p, limit, T, K, res;
	Map<String, Integer> ref;
	
	@SuppressWarnings("unchecked")
	void run(){
		Scanner sc = new Scanner(System.in);
		for(;;){
			n = sc.nextInt(); m = sc.nextInt();
			if((n|m)==0)break;
			ref = new HashMap<String, Integer>();
			limit = new int[n];
			p = new int[n];
			T = new int[m];
			K = new int[m];
			for(int i=0;i<n;i++){
				ref.put(sc.next(), i);
				limit[i] = sc.nextInt();
				p[i] = sc.nextInt();
			}
			List<Integer>[] l = new List[m];
			for(int i=0;i<m;i++){
				l[i] = new ArrayList<Integer>();
				T[i] = sc.nextInt();
				K[i] = sc.nextInt();
				for(int j=0;j<K[i];j++)l[i].add(ref.get(sc.next()));
			}
			res = new int[m];
			Arrays.fill(res, -1);
			Queue<Integer>[] c = new Queue[n];
			for(int i=0;i<n;i++)c[i]=new LinkedList<Integer>();
			int f = 0, t = 0, num = 0, make = 0;
			while(f<m||0<num){
				if(num==0&&f<m){
					t = T[f];
					for(int x:l[f]){
						num++; c[x].add(f);
					}
					f++;
				}
				while(f<m&&T[f]<=t){
					for(int x:l[f]){
						num++; c[x].add(f);
					}
					f++;
				}
				int max = 0, M = -1;
				for(int d = make;d<make+n;d++){
					if(!c[d%n].isEmpty()&&max<p[d%n]){
						max = p[d%n]; M = d%n;
					}
				}
				make = M;
				int L = limit[make];
				t += p[make];
				while(0<L&&!c[make].isEmpty()){
					int x = c[make].poll();
					--L; num--;
					if(--K[x]==0)res[x] = t;
				}
				make = (make+1)%n;
			}
			for(int r:res)System.out.println(r);
		}
	}
	
	public static void main(String[] args) {
		new Main().run();
	}
}