Problem: 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, ri]). 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, 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·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 li, ri (1 ≤ li ≤ ri ≤ 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 cnti (1 ≤ cnti ≤ 3·105) — the number of points in the i-th query. Then the line contains cnti distinct positive integers p1, p2, ..., pcnti (1 ≤ p1 < p2 < ... < pcnti ≤ 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. 

Output

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

Examples

Input

3 3
1 3
4 5
6 7
3 1 4 7
2 4 5
1 8


Output

3
1
0

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class E {

	public void solve() {
		int n = in.nextInt(), m = in.nextInt();
		int[] l = new int[n], r = new int[n];

		int[][] pts = new int[m][];
		for (int i = 0; i < n; i++) {
			l[i] = in.nextInt() - 1;
			r[i] = in.nextInt() - 1;
		}

		int sum = 2 * n;
		for (int j = 0; j < m; j++) {
			int cnt = in.nextInt();
			pts[j] = new int[cnt + 1];
			pts[j][0] = -1;
			for (int k = 0; k < cnt; k++) {
				pts[j][k + 1] = in.nextInt() - 1;
			}
			sum += cnt;
		}

		int[] ptr = new int[m];

		int tmp = 0;
		Event[] events = new Event[sum];
		for (int i = 0; i < n; i++) {
			events[tmp++] = new Event(0, l[i], i);
			events[tmp++] = new Event(2, r[i], i);
		}
		for (int j = 0; j < m; j++) {
			for (int k = 1; k < pts[j].length; k++) {
				events[tmp++] = new Event(1, pts[j][k], j);
			}
		}
		Arrays.sort(events);
//		System.err.println(Arrays.toString(events));
		BIT tree = new BIT(MAX);
		int[] ans = new int[m];

		for (int IT = 0; IT < events.length; IT++) {
			Event e = events[IT];

			if (e.type == 0) {
				tree.add(l[e.id], 1);
			} else if (e.type == 2) {
				tree.add(l[e.id], -1);
			} else {
				int from = pts[e.id][ptr[e.id]] + 1;
				ans[e.id] += tree.get(from, MAX - 1);
				ptr[e.id]++;
			}
		}

		for (int i : ans) {
			out.println(i);
		}
	}

	class BIT {
		int[] tree;

		public BIT(int n) {
			tree = new int[n];
		}

		void add(int pos, int val) {
			while (pos < tree.length) {
				tree[pos] += val;
				pos |= pos + 1;
			}
		}

		int get(int l, int r) {
			int res = get(r);
			if (l > 0) {
				res -= get(l - 1);
			}
			return res;
		}

		int get(int t) {
			int res = 0;
			while (t >= 0) {
				res += tree[t];
				t = (t & (t + 1)) - 1;
			}
			return res;
		}
	}

	final int MAX = (int) 1e6;

	class Event implements Comparable<Event> {
		int type, x;
		int id;

		public Event(int type, int x, int id) {
			super();
			this.type = type;
			this.x = x;
			this.id = id;
		}

		@Override
		public int compareTo(Event o) {
			if (x != o.x) {
				return x - o.x;
			}
			return type - o.type;
		}

		@Override
		public String toString() {
			return "Event [type=" + type + ", x=" + x + ", id=" + id + "]";
		}
		
		
	}

	FastScanner in;
	PrintWriter out;

	public void run() {
		try {
			in = new FastScanner();
			out = new PrintWriter(System.out);
			solve();
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

	class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		public FastScanner(String name) {
			try {
				br = new BufferedReader(new FileReader(name));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}

		public String nextToken() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextToken());
		}

		public long nextLong() {
			return Long.parseLong(nextToken());
		}

		public double nextDouble() {
			return Double.parseDouble(nextToken());
		}
	}

	public static void main(String[] args) {
		new E().run();
	}
}