#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;
set <int> s1, s2;

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, rez, r1, r2, cnt, j;
    set<int>::iterator it1, it2;
    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;
    cnt = 0;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        rez = 0;
        for (j = 1; j <= n; ++j)
        {
            rez = rez * 10;
            if (Semn(D[j], x, y) < 0) rez++;
            else rez += 2;
            r1 = rez % prim1;
            r2 = rez % prim2;
        }
        it1 = s1.find(r1);
        it2 = s2.find(r2);
        if (it1 == s1.end() && it2 == s2.end())
        {
            cnt++;
            s1.insert(r1);
            s2.insert(r2);
        }
    }
    fout << cnt << "\n";
    fin.close();
    fout.close();
    return 0;
}