#include <bits/stdc++.h>
using namespace std;
ifstream fcin("regiuni.in");
ofstream fcout("regiuni.out");

int p = 8867, q = 9973;
int n, m;

struct dreapta
{
    short a, b, c;
}v[1001];

int f(dreapta d, int x, int y)
{
    return ((d.a * x + d.b * y + d.c) > 0) ? 2 : 1;
}
pair<int, int> a[1001];
int main()
{
    fcin >> n >> m;
    for (int i = 1; i <= n; i++)
        fcin >> v[i].a >> v[i].b >> v[i].c;
    for (int i = 1; i <= m; i++)
    {
        int cod1, cod2;
        cod1 = cod2 = 0;
        int x, y;
        fcin >> x >> y;
        for (int j = 1; j <= n; j++)
        {
            int cif = f(v[j], x, y);
            cod1 = (cod1 * 97 + cif) % p;
            cod2 = (cod2 * 97 + cif) % q;
        }
        a[i] = {cod1, cod2};
    }
    sort(a + 1, a + m + 1);
    int rasp = 1;
    for (int i = 2; i <= m; i++)
    {
        if (a[i] != a[i - 1])
            rasp++;
    }
    fcout << rasp;

    return 0;
}