#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int Hsize = 61789;
const int Hsexion = 51;
const int Nmax = 1010 ;

int a[Nmax],b[Nmax],c[Nmax];
int Hash[Nmax];

int N,M,A,B,Sol;

int main()
{
	FILE *f = fopen("regiuni.in", "r");

    fscanf(f, "%d %d", &N, &M);
	for (int i=1;i<=N;++i)
		fscanf(f, "%d %d %d", &a[i], &b[i] ,&c[i]);
	
	for (int i=1;i<=M;++i)
	{
		int x,y;
		fscanf(f, "%d %d", &x, &y);
		
		A=0;
		for (int j=1;j<=N;++j)
			A=( A*Hsexion+( a[j]*x+b[j]*y+c[j] > 0 ) ) % Hsize ;
		
		Hash[i]= A;
	}
	sort(Hash+1,Hash+M+1);
	
	for (int i=1;i<=M;++i)
		if ( Hash[i]!=Hash[i-1] ) ++Sol;
	
	fprintf(fopen("regiuni.out", "w"), "%d\n" , Sol );
}