1 #include<iostream> 2 #include<algorithm> 3 #include<cstdio> 4 #include<cstdlib> 5 #include<cmath> 6 #include<cstring> 7 #include<queue> 8 #include<vector> 9 #include<map>10 using namespace std;11 #define llg int12 #define maxn 100010013 #define yyj(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);14 llg ans[maxn],n,m,c[maxn];15 vector<llg>q[maxn],belong[maxn],line[maxn];16 17 inline llg getint()18 {19     llg w=0,q=0; char c=getchar();20     while((c<‘0‘ || c>‘9‘) && c!=‘-‘) c=getchar();21     if (c==‘-‘)  q=1, c=getchar(); while (c>=‘0‘ && c<=‘9‘) w=w*10+c-‘0‘, c=getchar();22     return q ? -w : w;23 }24 25 void inc(llg x) {for (;x<maxn;x+=x&-x) c[x]++;}26 27 llg sum(llg x) {if (x==0) return 0; llg val=0; for (;x>0;x-=x&-x) val+=c[x]; return val;}28 29 void init()30 {31     cin>>n>>m;32     for (llg i=1;i<=n;i++)33     {34         llg l=getint(),r=getint();35         line[r].push_back(l);36     }37     for (llg i=1;i<=m;i++)38     {39         ans[i]=n;40         llg k=getint(),x=0;41         for (llg j=1;j<=k;j++)42         {43             llg wz=getint();44             q[wz].push_back(x);45             belong[wz].push_back(i);46             x=wz;47         }48         q[1000001].push_back(x);49         belong[1000001].push_back(i);50     }51 }52 53 int main()54 {55     yyj("ds");56     init();57     for (llg i=1;i<=1000002;i++)58     {59         llg w=q[i].size();60         for (llg j=0;j<w;j++)61         {62             ans[belong[i][j]]-=sum(i-1)-sum(q[i][j]);63         }64         w=line[i].size();65         for (llg j=0;j<w;j++)66         {67             llg x=line[i][j];68             inc(x);69         }70     }71     for (llg i=1;i<=m;i++) printf("%d\n",ans[i]);72     return 0;73 }