#include <bits/stdc++.h>
using namespace std;
const int N = 1000000;
struct Node {
  Node *lc, *rc;
  int size;
} * Null, *root[1000010];
int m, n;
Node *Insert(Node *p, int l, int r, int x) {
  Node *q = new Node;
  *q = *p, ++q->size;
  if (l == r) return q;
  int mid = (l + r) >> 1;
  if (x <= mid)
    q->lc = Insert(p->lc, l, mid, x);
  else
    q->rc = Insert(p->rc, mid + 1, r, x);
  return q;
}
int getsum(Node *p, int l, int r, int x, int y) {
  if (p == Null || (l == x && r == y)) return p->size;
  int mid = (l + r) >> 1;
  if (y <= mid)
    return getsum(p->lc, l, mid, x, y);
  else if (mid < x)
    return getsum(p->rc, mid + 1, r, x, y);
  else
    return getsum(p->lc, l, mid, x, mid) +
           getsum(p->rc, mid + 1, r, mid + 1, y);
}
void read() {
  Null = new Node;
  Null->lc = Null->rc = Null, Null->size = 0;
  fill(root + 1, root + N + 2, Null);
  static pair<int, int> a[300010];
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d %d", &a[i].first, &a[i].second);
  sort(a + 1, a + n + 1);
  for (int i = N, j = n; i >= 1; --i) {
    root[i] = root[i + 1];
    while (a[j].first == i) root[i] = Insert(root[i], 1, N, a[j--].second);
  }
}
void Query() {
  static int p[300010];
  for (int i = 1, t; i <= m; ++i) {
    scanf("%d", &t);
    int ans = n;
    for (int j = 1; j <= t; ++j) {
      scanf("%d", p + j);
      int l = p[j - 1] + 1, r = p[j] - 1;
      if (l <= r) ans -= getsum(root[l], 1, N, l, r);
    }
    if (p[t] < N) ans -= getsum(root[p[t] + 1], 1, N, p[t] + 1, N);
    printf("%d\n", ans);
  }
}
int main() {
  read();
  Query();
  return 0;
}
