#include <bits/stdc++.h>
#define prim1 9973
#define prim2 8867

using namespace std;

struct dreapta
{
    short a, b, c;
};
dreapta D[1001];
int n, m;
int s1[1001], s2[1001];

inline int Semn(dreapta D, int x, int y)
{
    if (D.a * x + D.b * y + D.c < 0) return -1;
    return 1;
}

int main()
{
    int i, x, y, r1, r2, cnt, j, gasit;
    ifstream fin("regiuni.in");
    ofstream fout("regiuni.out");
    fin >> n >> m;
    for (i = 1; i <= n; i++)
        fin >> D[i].a >> D[i].b >> D[i].c;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        r1 = r2 = 0;
        for (j = 1; j <= n; ++j)
        {
            r1 = r1 * 10;
            r2 = r2 * 10;
            if (Semn(D[j], x, y) < 0) { r1++; r2++;}
            else {r2 += 2; r1 += 2;}
            r1 = r1 % prim1;
            r2 = r2 % prim2;
        }
        s1[i] = r1;
        s2[i] = r2;
    }
    cnt = 1;
    for (i = 2; i <= m; i++)
    {
        x = s1[i];
        y = s2[i];
        gasit = 0;
        for (j = 1; j < i && !gasit; j++)
            if (s1[j] == x && s2[j] == y) gasit = 1;
        if (gasit == 0) cnt++;
    }
    fout << cnt << "\n";
    fin.close();
    fout.close();
    return 0;
}