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.

Input

The first line contains two integers $*n*$, $*m*$ ($1 ≤ *n*, *m* ≤ 3·10^{5}$) — 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*} ≤ 10^{6}$) — 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·10^{5}$) — 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*}} ≤ 10^{6}$) — 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·10^{5}$.

Output

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