#include <bits/stdc++.h>
using namespace std;

int main() {
	freopen("regiuni.in", "r", stdin);
	freopen("regiuni.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	
	vector<vector<int>> d(n, vector<int>(3));
	for(int i = 0;i < n;++i)
		cin >> d[i][0] >> d[i][1] >> d[i][2];
	vector<vector<int>> p(m, vector<int>(2));
	for(int i = 0;i < m;++i)
		cin >> p[i][0] >> p[i][1];
	unordered_set<uint64_t> st;
	for(int i = 0;i < m;++i)
	{
		uint64_t nr = 0;
		for(int j = 0;j < n;++j)
		{
			int v = d[j][0] * p[i][0] + d[j][1] * p[i][1] + d[j][2];
			if(v > 0)
				nr = 2 * nr + 1;
		}
		st.insert(nr);
	}
	cout << st.size() << "\n";
}