The first line contains integers m,n,k (1≤m,n≤100, 1≤k≤30) − amount of subjects on the list, amount of Valera's potential employers and the duration of the exam period in days.

The following m lines contain the names of subjects list_i (list_i is a non-empty string of at most 32 characters, consisting of lower case Latin letters). It's guaranteed that no two subjects are the same.

The (m+2)-th line contains m integers t_i (1≤t_i≤1000) − time in minutes that Valera spends to solve problems of the i-th subject. Then follow four lines, containing time segments for sleep, breakfast, lunch and dinner correspondingly.

Each line is in format H1:M1-H2:M2, where 00≤ H1, H2 ≤23, 00≤ M1, M2 ≤59. Time H1:M1 stands for the first minute of some Valera's action, and time H2:M2 stands for the last minute of this action. No two time segments cross. It's guaranteed that Valera goes to bed before midnight, gets up earlier than he has breakfast, finishes his breakfast before lunch, finishes his lunch before dinner, and finishes his dinner before midnight. All these actions last less than a day, but not less than one minute. Time of the beginning and time of the ending of each action are within one and the same day. But it's possible that Valera has no time for solving problems.

Then follow n lines, each containing the description of students. For each student the following is known: his exam subject s_i (s_i is a non-empty string of at most 32 characters, consisting of lower case Latin letters), index of the exam day d_i (1≤d_i≤k), the exam time time_i, and sum of money c_i (0≤c_i≤10⁶, c_i − integer) that he's ready to pay for Valera's help. Exam time time_i is in the format HH:MM, where 00≤ HH ≤23, 00≤ MM ≤59. Valera will get money, if he finishes to solve the problem strictly before the corresponding student's exam begins.