#include<stdio.h>
#include<stdlib.h>


short int n, m, i;
unsigned char * francesca, * natasa;
int cmp(const void *a, const void *b)
{
	francesca=(unsigned char *) a;
	natasa=(unsigned char *) b;
	for (i=0; i<=n/8; i++)
		if (francesca[i]>natasa[i]) return 1;
	return 0;
}

int main()
{
	
	char mat[1001][125];
	short int dr[1001][3], i, j, x, y, count=0;
	
	//for (i=0; i<1001; i++)
	 //   for (j=0; j<125; j++)
	    //    mat[i][j]=0;
    freopen("regiuni.in", "r", stdin);
	freopen("regiuni.out", "w", stdout);
	
    scanf("%hd%hd", &n, &m);
	
	for (i=0; i<n; i++)
		scanf("%hd%hd%hd", &dr[0][i], &dr[1][i], &dr[2][i]);
	
	for (i=1; i<=m; i++)
	{
		scanf("%hd%hd", &x, &y);
		for (j=0; j<n; j++)
			if (dr[0][j]*x+dr[1][j]*y+dr[2][j] > 0) mat[i][j/8]= mat[i][j/8] |  (1<<j%8);
	}
	
	
	
	qsort(mat, m+1, sizeof(mat[0]), cmp);
	
	/*for (i=0; i<m; i++)
	{
		for (j=0; j<n; j++)
			printf("%u ", mat[i][j]);
		printf("\n");
	}*/
	
	for (i=1; i<=m; i++)
	{
		for (j=0; j<=n/8; j++)
			if ( mat[i][j]!=mat[i-1][j] ){ count++; break;}
 	}
	printf("%hd", count);
	return 0;
}