CF369E.Valera and Queries

Valera loves segments. He has recently come up with one interesting problem.

The Ox axis of coordinates has n segments, the i-th segment starts in position l__i and ends in position r__i (we will mark it as [l__i, r__i]). Your task is to process m queries, each consists of number cnt__i and a set of cnt__i coordinates of points located on the Ox axis. The answer to the query is the number of segments, such that each of them contains at least one point from the query. Segment [l, r] contains point q, if l ≤ q ≤ r.

Valera found the solution of this problem too difficult. So he asked you to help him. Help Valera.

瓦莱拉喜欢线段。他最近提出了一个有趣的问题。

在坐标系的 $Ox$ 轴上有 $n$ 条线段，其中第 $i$ 条线段起始于位置 $l_i$，终止于位置 $r_i$（记为 $[l_i,\,r_i]$）。你的任务是处理 $m$ 个查询，每个查询包含一个整数 $cnt_i$ 和一组位于 $Ox$ 轴上的 $cnt_i$ 个点的坐标。查询的答案是：满足“该线段至少包含查询中一个点”的线段的数目。线段 $[l,\,r]$ 包含点 $q$，当且仅当 $l \le q \le r$。

瓦莱拉发现这个问题的解法过于困难，因此他请你帮忙。请帮助瓦莱拉。

The first line contains two integers n, m (1 ≤ n, m ≤ 3·105) — the number of segments on the axis of coordinates and the number of queries.

Next n lines contain the descriptions of the segments. The i-th line contains two positive integers l__i, r__i (1 ≤ l__i ≤ r__i ≤ 106) — the borders of the i-th segment.

Next m lines contain the description of the queries, one per line. Each line starts from integer cnt__i (1 ≤ cnt__i ≤ 3·105) — the number of points in the i-th query. Then the line contains cnt__i distinct positive integers _p_1, _p_2, ..., p__cnt__i (1 ≤ _p_1 < _p_2 < ... < p__cnt__i ≤ 106) — the coordinates of points in the i-th query.

It is guaranteed that the total number of points in all queries doesn't exceed 3·105.

第一行包含两个整数 $n$、$m$（$1 \leq n, m \leq 3 \cdot 10^5$）—— 分别表示坐标轴上线段的数量和查询的数量。

接下来的 $n$ 行描述了这些线段。第 $i$ 行包含两个正整数 $l_i$、$r_i$（$1 \leq l_i \leq r_i \leq 10^6$）—— 表示第 $i$ 条线段的左右端点。

接下来的 $m$ 行描述了各次查询，每行一条。每行首先是一个整数 $cnt_i$（$1 \leq cnt_i \leq 3 \cdot 10^5$）—— 表示第 $i$ 次查询中点的个数；随后是 $cnt_i$ 个互不相同的正整数 $p_1,\,p_2,\,...,\,p_{cnt_i}$（$1 \leq p_1 < p_2 < ... < p_{cnt_i} \leq 10^6$）—— 表示第 $i$ 次查询中各点的坐标。

保证所有查询中点的总数不超过 $3 \cdot 10^5$。

Print m non-negative integers, where the i-th number is the response to the i-th query.

输出 m 个非负整数，其中第 i 个数为对第 i 个查询的回答。