Forming Teams

There are $N$ students numbered $0$ through $N-1$. Every day the teacher prepares one or more projects, and each project is handled by one team that the students form on that day. Projects differ in difficulty, so the size of the team that handles a project is fixed in advance.

Students differ in the team sizes they accept. Student $i$ can join a team only if that team has at least $A_i$ and at most $B_i$ members. On a single day a student belongs to at most one team, and a student may belong to no team at all. One team handles exactly one project.

If a day has $M$ projects and the team for project $j$ must have size $K_j$, then teams of sizes $K_0, K_1, \ldots, K_{M-1}$ all have to exist on that day at the same time. The sum of the $K_j$ can exceed $N$.

Teams are formed again from scratch every day, so the teams of one day do not restrict any other day. The teacher has already planned $Q$ days. For each day, decide whether all the teams planned for that day can be formed.

The first line contains the number of students $N$. ($1 \le N \le 500000$)

Each of the next $N$ lines contains $A_i$ and $B_i$ separated by a space, in the order $i = 0, 1, \ldots, N-1$. ($1 \le A_i \le B_i \le N$)

The next line contains the number of days $Q$. ($1 \le Q \le 200000$)

Each of the next $Q$ lines describes one day, in the planned order. A line contains the number of projects $M$ followed by the team sizes $K_0, K_1, \ldots, K_{M-1}$, with all numbers separated by spaces. ($1 \le M \le N$, $1 \le K_j \le N$)

The sum of $M$ over all days is at most $200000$.

For each day, print $1$ if all the teams planned for that day can be formed, and $0$ otherwise. Print one answer per line, in the order the days are given.