#include <bits/stdc++.h>
#define P 45999139

using namespace std;

ifstream fin("regiuni.in");
ofstream fout("regiuni.out");

int n, m;
int a[1005][5];
unordered_map<int, int> M;

void Grops(int x, int y)
{
    int i, nr = 0;
    for (i = 1; i <= n; i++)
    {
        if (a[i][1] * x + a[i][2] * y + a[i][3] > 0) nr = (nr * 2 + 1) % P;
        else nr = nr * 2 % P;
    }
    M[nr]++;
}

void Citire()
{
    int i, j, x, y;
    fin >> n >> m;
    for (i = 1; i <= n; i++) fin >> a[i][1] >> a[i][2] >> a[i][3];
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        Grops(x, y);
    }
    fin.close();
}

int main()
{

    Citire();
    fout << M.size() << "\n";
    fout.close();

    return 0;
}