#include <cstdio>
#include <vector>
#define mod 100003
#define maxn 1010

using namespace std;

struct dreapta {
	int a, b, c;
};

struct punct {
	int x, y;
};

int n, m, i, j, nr, sol, k, nra, ct;
dreapta v[maxn];
punct t[maxn];
vector <int> x[1010], xa[1010];
vector <int> v1, v2;



int main() {
	freopen("regiuni.in", "r", stdin);
	freopen("regiuni.out", "w", stdout);
	
	scanf("%d%d", &n, &m);
	for (i = 1; i <= n; i++)
		scanf("%d%d%d", &v[i].a, &v[i].b, &v[i].c);
	for (i = 1; i <= m; i++) {
		scanf("%d%d", &t[i].x, &t[i].y);
		x[1].push_back(i);
	}
	nr = 1;
	
	for (i = 1; i <= n; i++) {
		//fac treaba pentru dreapta i
		nra = nr; ct = 0;
		for (j = 1; j <= nra; j++) {
			v1.clear(); v2.clear();
			for (k = 0; k < x[j].size(); k++)
				if (v[i].a * t[x[j][k]].x + v[i].b * t[x[j][k]].y + v[i].c < 0)
					v1.push_back(x[j][k]);
				else
					v2.push_back(x[j][k]);
			if (v2.size() && v1.size()) {
				ct++;
				xa[ct] = v2;
				ct++;
				xa[ct] = v1;
			}
			else {
				ct++;
				if (v1.size())
					xa[ct] = v1;
				else
					xa[ct] = v2;
			}
		}
		nr = ct;
		for (j = 0; j <= nr; j++)
			x[j] = xa[j];
		for (j = 0; j <= n; j++)
			xa[j].clear();
	}
	
	printf("%d\n", nr);
	
	return 0;
}