CF1765L.Project Manager

There are $n$ employees at Bersoft company, numbered from $1$ to $n$. Each employee works on some days of the week and rests on the other days. You are given the lists of working days of the week for each employee.

There are regular days and holidays. On regular days, only those employees work that have the current day of the week on their list. On holidays, no one works. You are provided with a list of days that are holidays. The days are numbered from $1$ onwards, day $1$ is Monday.

The company receives $k$ project offers they have to complete. The projects are numbered from $1$ to $k$ in the order of decreasing priority.

Each project consists of multiple parts, where the $i$-th part must be completed by the $a_i$-th employee. The parts must be completed in order (i. e. the $(i+1)$-st part can only be started when the $i$-th part is completed). Each part takes the corresponding employee a day to complete.

The projects can be worked on simultaneously. However, one employee can complete a part of only one project during a single day. If they have a choice of what project to complete a part on, they always go for the project with the highest priority (the lowest index).

For each project, output the day that project will be completed on.

Bersoft 公司共有 $n$ 名员工，编号从 $1$ 到 $n$。每名员工在一周中的某些天工作，其余天休息。你将获得每名员工的工作日列表。

日期分为常规工作日和节假日。在常规工作日，仅当某员工的工作日列表中包含当天对应的星期几时，该员工才工作；在节假日，所有员工均不工作。你将获得一个节假日列表，其中日期按自然数编号（即第 $1$ 天为星期一）。

公司共收到 $k$ 个需完成的项目委托，项目按优先级降序编号为 $1$ 至 $k$（即编号越小，优先级越高）。

每个项目由多个部分组成，其中第 $i$ 个部分必须由第 $a_i$ 号员工完成。各部分必须按顺序完成（即只有在第 $i$ 个部分完成后，才能开始第 $i+1$ 个部分）。每个部分需耗时一天，由指定员工完成。

不同项目可并行推进。但一名员工在同一天内最多只能完成一个项目的一个部分。若某员工当天有多个项目部分可选，则总是优先选择优先级最高的项目（即编号最小的项目）。

对每个项目，请输出其完成的日期。

The first line contains three integers $n, m$ and $k$ ($1 \le n, m, k \le 2 \cdot 10^5$) — the number of employees, the number of holidays and the number of projects.

The $i$-th of the next $n$ lines contains the list of working days of the $i$-th employee. First, a single integer $t$ ($1 \le t \le 7$) — the number of working days. Then $t$ days of the week in the increasing order. The possible days are: "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday".

The next line contains $m$ integers $h_1, h_2, \dots, h_m$ ($1 \le h_1 \lt h_2 \lt \dots \lt h_m \le 10^9$) — the list of holidays.

The $j$-th of the next $k$ lines contains a description of the $j$-th project. It starts with an integer $p$ ($1 \le p \le 2 \cdot 10^5$) — the number of parts in the project. Then $p$ integers $a_1, a_2, \dots, a_p$ ($1 \le a_x \le n$) follow, where $p_i$ is the index of the employee that must complete the $i$-th part.

The total number of parts in all projects doesn't exceed $2 \cdot 10^5$.

第一行包含三个整数 $n, m$ 和 $k$（$1 \le n, m, k \le 2 \cdot 10^5$）——分别表示员工人数、假期天数和项目数。

接下来的 $n$ 行中，第 $i$ 行描述第 $i$ 位员工的工作日安排。首先是一个整数 $t$（$1 \le t \le 7$），表示该员工每周工作天数；随后是 $t$ 个按升序排列的工作日，取值范围为："Monday"、"Tuesday"、"Wednesday"、"Thursday"、"Friday"、"Saturday"、"Sunday"。

下一行包含 $m$ 个整数 $h_1, h_2, \dots, h_m$（$1 \le h_1 \lt h_2 \lt \dots \lt h_m \le 10^9$）——表示所有假期日期。

接下来的 $k$ 行中，第 $j$ 行描述第 $j$ 个项目。该行以一个整数 $p$（$1 \le p \le 2 \cdot 10^5$）开头，表示该项目包含的子任务数量；随后是 $p$ 个整数 $a_1, a_2, \dots, a_p$（$1 \le a_x \le n$），其中 $a_i$ 表示必须完成第 $i$ 个子任务的员工编号。

所有项目中的子任务总数不超过 $2 \cdot 10^5$。

Print $k$ integers — the $j$-th value should be equal to the day the $j$-th project is completed on.

输出 $k$ 个整数——第 $j$ 个值应等于第 $j$ 个项目完成的天数。