B"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 li and ends in position ri (we will mark it as [li, xe2 x80 x89ri]). Your task is to process m queries, each consists of number cnti and a set of cnti 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, xe2 x80 x89r] contains point q, if l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89q xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r. Valera found the solution of this problem too difficult. So he asked you to help him. Help Valera. The first line contains two integers n, m (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x893 xc2 xb7105) -- 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 li, ri (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89li xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ri xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106) -- the borders of the i-th segment. Next m lines contain the description of the queries, one per line. Each line starts from integer cnti (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89cnti xe2 x80 x89 xe2 x89 xa4 xe2 x80 x893 xc2 xb7105) -- the number of points in the i-th query. Then the line contains cnti distinct positive integers p1, xe2 x80 x89p2, xe2 x80 x89..., xe2 x80 x89pcnti (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89p1 xe2 x80 x89< xe2 x80 x89p2 xe2 x80 x89< xe2 x80 x89... xe2 x80 x89< xe2 x80 x89pcnti xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106) -- 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 xc2 xb7105. Print m non-negative integers, where the i-th number is the response to the i-th query."...