#include <bits/stdc++.h>
using namespace std;
const double eps(1e-8);
int n, m, len;
vector<int> L[1000010];
vector<int> vec[1000010];
vector<int> p[1000010];
int x[1000010], ans[1000010], c[1000010];
int Lowbit(int x) { return x & (-x); }
void Update(int pos, int val) {
  while (pos <= 1000000) {
    c[pos] += val;
    pos += Lowbit(pos);
  }
}
int Query(int pos) {
  int ret = 0;
  while (pos > 0) {
    ret += c[pos];
    pos -= Lowbit(pos);
  }
  return ret;
}
void Divide(int len, int idx) {
  for (int i = 1; i < len; i++) {
    if (x[i] + 1 >= x[i + 1]) continue;
    vec[x[i + 1] - 1].push_back(x[i] + 1);
    p[x[i + 1] - 1].push_back(idx);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  int a, b;
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &a, &b);
    L[b].push_back(a);
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d", &b);
    len = 0, x[++len] = 0;
    for (int j = 1; j <= b; j++) {
      scanf("%d", &a);
      x[++len] = a;
    }
    x[++len] = 1000001;
    Divide(len, i);
  }
  for (int i = 1; i <= m; i++) ans[i] = n;
  int sum = 0;
  for (int i = 1; i <= 1000000; i++) {
    for (int j = 0; j < (int)L[i].size(); j++) {
      Update(L[i][j], 1);
      sum++;
    }
    int l, idx;
    for (int j = 0; j < (int)vec[i].size(); j++) {
      l = vec[i][j], idx = p[i][j];
      ans[idx] -= sum - Query(l - 1);
    }
  }
  for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
  return 0;
}
