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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5, M = 1e6 + 6;
struct node {
  int sum = 0;
  node *left, *right;
  node(int sum, node *left, node *right) : sum(sum), left(left), right(right) {}
  node(int sum = 0) : sum(sum), left(this), right(this) {}
};
node *insert(node *cur, int v, int l = -M, int r = M) {
  if (v < l || v > r) return cur;
  if (l == r) return new node(cur->sum + 1);
  int mid = l + ((r - l) >> 1);
  node *left = insert(cur->left, v, l, mid);
  node *right = insert(cur->right, v, mid + 1, r);
  return new node(left->sum + right->sum, left, right);
}
int query(node *bs, node *en, int s, int e, int l = -M, int r = M) {
  if (e < s || l > e || r < s) return 0;
  if (l >= s && r <= e) return en->sum - bs->sum;
  int mid = l + ((r - l) >> 1);
  return query(bs->left, en->left, s, e, l, mid) +
         query(bs->right, en->right, s, e, mid + 1, r);
}
node *roots[N];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  vector<pair<int, int> > info(n);
  for (int i = 0; i < n; i++) scanf("%d%d", &info[i].second, &info[i].first);
  sort(info.begin(), info.end());
  roots[0] = new node();
  for (int i = 0; i < info.size(); i++)
    roots[i + 1] = insert(roots[i], info[i].second);
  int cnt;
  for (int i = 0; i < m; i++) {
    scanf("%d", &cnt);
    vector<int> points(cnt);
    for (int j = 0; j < cnt; j++) scanf("%d", &points[j]);
    sort(points.begin(), points.end());
    int ans = 0;
    for (int j = 0; j < cnt; j++) {
      int nxt = j == cnt - 1 ? 1e6 : points[j + 1] - 1;
      pair<int, int> t = {nxt, 1e9}, tt = {points[j], -1e9};
      int ind = upper_bound(info.begin(), info.end(), t) - info.begin() - 1;
      int ind2 = lower_bound(info.begin(), info.end(), tt) - info.begin();
      ans += query(roots[ind2], roots[ind + 1], 0, points[j]);
    }
    printf("%d\n", ans);
  }
}