#include<stdio.h>

int s[1002][35],a[1002],b[1002],c[1002],aux[35],lim,cst=30;

void intersc(int i,int j)
{
int x;
for(x=0;x<=lim;x++)
   aux[x]=s[i][x];
for(x=0;x<=lim;x++)
   s[i][x]=s[j][x];
for(x=0;x<=lim;x++)
   s[j][x]=aux[x];     
}

int cmp(int i,int j)
{
int x=0;
while(x<=lim && s[i][x]==s[j][x]) x++;
if(x>lim) return 0;
if(s[i][x]<s[j][x])
   return -1;
return 1;    
}

int main()
{
FILE *fin=fopen("regiuni.in","r"),
     *fout=fopen("regiuni.out","w");
int m,n,i,j,x,y,k;
fscanf(fin,"%d%d",&n,&m);

for(i=1;i<=n;i++)
  fscanf(fin,"%d%d%d",&a[i],&b[i],&c[i]);

for(i=1;i<=m;i++)
  {
  fscanf(fin,"%d%d",&x,&y);
  
  for(j=1;j<=n;j++)
     if(a[j]*x+b[j]*y+c[j]>0)
        s[i][j/cst]|=(1<<(j%cst));                    
  }
lim=n/cst;
  
//sortare
for(i=1;i<=m;i++)
  {
  j=i;
  while(j/2 && cmp(j,j/2) > 0)
      {
      intersc(j/2,j);
      j/=2;
      }               
  }
  
i=m;
while(i>1)
  {
  intersc(1,i);
  i--;
  
  j=1;
  while(1)        
    {
    k=2*j;
    if(k>i) break;
    if(k+1<=i && cmp(k+1,k)>0) k++;
    if(cmp(j,k) >= 0) break;
    
    intersc(j,k);
    j=k;
    }
  }

int sol=1;
for(i=2;i<=m;i++)
   if(cmp(i,i-1))
      sol++;

fprintf(fout,"%d\n",sol);

fclose(fin);
fclose(fout);
return 0;
}