#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> a[1000005], s[4000005];
void Build(int k, int l, int r) {
  if (l == r) {
    s[k] = a[l];
    return;
  }
  int mid = (l + r) / 2;
  Build(k * 2, l, mid);
  Build(k * 2 + 1, mid + 1, r);
  int s1 = 0, s2 = 0, a = s[k * 2].size(), b = s[k * 2 + 1].size();
  while (s1 < a || s2 < b) {
    if (s2 >= b || (s1 < a && s[k * 2][s1] <= s[k * 2 + 1][s2]))
      s[k].push_back(s[k * 2][s1]), s1++;
    else
      s[k].push_back(s[k * 2 + 1][s2]), s2++;
  }
}
int Get(int k, int l, int r, int x, int y, int z) {
  if (l == x && r == y)
    return (upper_bound(s[k].begin(), s[k].end(), z) - s[k].begin());
  int mid = (l + r) / 2;
  if (x > mid) return Get(k * 2 + 1, mid + 1, r, x, y, z);
  if (y <= mid) return Get(k * 2, l, mid, x, y, z);
  return Get(k * 2, l, mid, x, mid, z) +
         Get(k * 2 + 1, mid + 1, r, mid + 1, y, z);
}
int main() {
  scanf("%d%d", &n, &m);
  int x, y;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x, &y);
    a[x].push_back(y);
  }
  for (int i = 1; i <= 1000000; i++) sort(a[i].begin(), a[i].end());
  Build(1, 1, 1000000);
  for (int i = 0; i < m; i++) {
    scanf("%d", &x);
    int L = 0, R, ans = 0;
    for (int j = 0; j < x; j++) {
      scanf("%d", &R);
      if (L + 1 <= R - 1) ans += Get(1, 1, 1000000, L + 1, R - 1, R - 1);
      L = R;
    }
    if (L + 1 <= 1000000) ans += Get(1, 1, 1000000, L + 1, 1000000, 1000000);
    printf("%d\n", n - ans);
  }
  return 0;
}
