using namespace std;
#include<fstream>
#include<stdio.h>
#define nmax 1005
#define lmax 35
#define cst 30

int s[nmax][lmax],a[nmax],b[nmax],c[nmax],aux[lmax];

int main()
{
FILE *fin=fopen("regiuni.in","r"),
     *fout=fopen("regiuni.out","w");
     
memset(s,0,sizeof s);
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));                    
  }
  
//sortare
for(i=1;i<=m;i++)
  {
  j=i;
  while(j/2 && memcmp(s[j],s[j/2],sizeof s[j]) > 0)
      {
      memcpy(aux,s[j],sizeof aux);
      memcpy(s[j],s[j/2],sizeof s[j]);
      memcpy(s[j/2],aux,sizeof aux);
      j/=2;
      }               
  }
  
i=m;
while(i>1)
  {
  memcpy(aux,s[1],sizeof aux);
  memcpy(s[1],s[i],sizeof s[1]);
  memcpy(s[i],aux,sizeof aux);
  i--;
  
  j=1;
  while(1)        
    {
    k=2*j;
    if(k>i) break;
    if(k+1<=i && memcmp(s[k+1],s[k],sizeof s[k])>0) k++;
    if(memcmp(s[j],s[k],sizeof s[k]) >= 0) break;
    
    memcpy(aux,s[j],sizeof aux);
    memcpy(s[j],s[k],sizeof s[j]);
    memcpy(s[k],aux,sizeof aux);
    j=k;
    }
  }

int sol=1;
for(i=2;i<=m;i++)
   if(memcmp(s[i],s[i-1],sizeof s[i]))
      sol++;
fprintf(fout,"%d\n",sol);

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