#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
#define eprintf(s...) fprintf(stderr, s)

template<class T> inline void amin(T &a, const T &b) { if (b<a) a=b; }
template<class T> inline void amax(T &a, const T &b) { if (a<b) a=b; }

template<class T> struct RangeTree {
    int m;
    vector<vector<T> > data;
    RangeTree(){}
    RangeTree(const vector<T>&val) {
    int n = val.size();
    m = 1;
    for (;m<n;) m *= 2;
    data = vector<vector<T> >(m*2);
    for (int i=0; i<n; i++) data[i+m].push_back(val[i]);
    T ma = *max_element(val.begin(), val.end());
    for (int i=n; i<m; i++) data[i+m].push_back(ma);
    for (int i=m; --i;) {
        data[i] = vector<int>(data[2*i].size()+data[2*i+1].size());
        merge(data[2*i].begin(), data[2*i].end(), data[2*i+1].begin(), data[2*i+1].end(), data[i].begin());
    }
    }
    // #[i | lo<=val(i)<hi and i<-[x,y)]
    int count(int x, int y, const T&lo, const T&hi) { return count(x, y, lo, hi, 1, 0, m); }
    int count(int x, int y, const T&lo, const T&hi, int k, int l, int r) {
    if (r<=x || y<=l) return 0;
    if (x<=l && r<=y)
        return lower_bound(data[k].begin(), data[k].end(), hi)
        - lower_bound(data[k].begin(), data[k].end(), lo);
    else return count(x, y, lo, hi, k*2, l, (l+r)/2)+count(x, y, lo, hi, k*2+1, (l+r)/2, r);
    }
    // [i | lo<=val(i)<hi and i<-[x,y)] ! n
    int nth(int x, int y, const T&lo, const T&hi, int n) {
    int k=1, l=0, r=m;
    while (k<m) {
        int s = (l+r)/2;
        int c = count(x, y, lo, hi, k*2, l, s);
        if (n<c) { r=s; k=k*2; }
        else { n=n-c; l=s; k=k*2+1; }
    }
    return n ? -1 : data[k][0];
    }
};

int N, M, L[300011], R[300011], S[300011];
pair<int, int> A[300011];
int P[300011];
const int INF = 1<<29;

void MAIN() {
    REP (i, N) {
    scanf("%d%d", L+i, R+i);
    A[i] = make_pair(R[i], L[i]);
    }
    sort(A, A+N);
    REP (i, N) S[i] = A[i].second;
    RangeTree<int> X(VI(S, S+N));

    REP ($, M) {
    int K;
    scanf("%d", &K);
    REP (i, K) scanf("%d", P+i);
    P[K] = INF;
    int ans = 0;
    int l, r;
    l = lower_bound(A, A+N, make_pair(P[0], -1)) - A;
    REP (i, K) {
        r = lower_bound(A+l, A+N, make_pair(P[i+1], -1)) - A;
        if (l < r) ans += X.count(l, r, 0, P[i]+1);
        l = r;
    }
    printf("%d\n", ans);
    }
}

int main() {
    while (scanf("%d%d", &N, &M) != EOF) MAIN();
    return 0;
}