#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
struct Segment {
  int l, r;
  Segment() {}
  Segment(int l, int r) : l(l), r(r) {}
  bool operator<(const Segment& other) const {
    return l < other.l || (l == other.l && r < other.r);
  }
};
struct Point {
  int x;
  Point() {}
  Point(int x) : x(x) {}
};
vector<vector<int> > t;
void build(int v, int tl, int tr, vector<int>& a) {
  if (tl == tr) {
    t[v] = {a[tl]};
  } else {
    int tm = (tl + tr) / 2;
    build(v * 2, tl, tm, a);
    build(v * 2 + 1, tm + 1, tr, a);
    merge(t[v * 2].begin(), t[v * 2].end(), t[v * 2 + 1].begin(),
          t[v * 2 + 1].end(), back_inserter(t[v]));
  }
}
int get(int v, int tl, int tr, int l, int r, int x) {
  if (l > r || l < tl || tr < r) return 0;
  if (tl == l && tr == r) {
    auto it = lower_bound(t[v].begin(), t[v].end(), x);
    return it - t[v].begin();
  } else {
    int tm = (tl + tr) / 2;
    int ql = get(v * 2, tl, tm, l, min(r, tm), x);
    int qr = get(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, x);
    return ql + qr;
  }
}
bool comp(Segment a, Segment b) { return a.l < b.l; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  vector<Segment> v;
  vector<int> l(n), r(n);
  t.resize(4 * n);
  for (int i = 0; i < n; i++) {
    int l, r;
    cin >> l >> r;
    v.push_back({l, r});
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    l[i] = v[i].l;
    r[i] = v[i].r;
  }
  build(1, 0, n - 1, r);
  for (int i = 0; i < m; i++) {
    int k;
    cin >> k;
    int ans = 0;
    vector<int> p;
    p.push_back(0);
    for (int j = 0; j < k; j++) {
      int p1;
      cin >> p1;
      p.push_back(p1);
    }
    p.push_back(1e6 + 1);
    for (int j = 1; j < p.size(); j++) {
      int l1 = upper_bound(l.begin(), l.end(), p[j - 1]) - l.begin();
      int r1 = lower_bound(l.begin(), l.end(), p[j]) - l.begin();
      r1--;
      if (r1 < l1) {
        continue;
      }
      ans += get(1, 0, n - 1, l1, r1, p[j]);
    }
    cout << n - ans << endl;
  }
  return 0;
}
