#include<fstream>
#include<string.h>
#include<ctype.h>
#include<iostream>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<array>
#include<deque>
#include<math.h>
#include<unordered_set>
#include<set>
#include<iomanip>
#include<bitset>
using namespace std;
struct drepta
{
	int a;
	int b;
	int c;
}dr[1111];
int n, m,i,j,x,y;
unordered_set<bitset<1111>>st;
int main()
{
	//ifstream f("file.in");
	//ofstream g("file.out");
	ifstream f("regiuni.in");
	ofstream g("regiuni.out");
	f >> n >> m;
	for (i = 0; i < n; i++)
	{
		f >> dr[i].a >> dr[i].b >> dr[i].c;
	}
	for (i = 1; i <= m; i++)
	{
		f >> x >> y;
		bitset<1111>temp;
		for (j = 0; j < n; j++)
		{
			if ((dr[j].a*x + dr[j].b*y+dr[j].c)>0)
				temp[j] = 1;
		}
		st.insert(temp);
	}
	g << st.size();
	return 0;
}