#include <stdio.h>
#include <map>
#include <utility>
using namespace std;

#define mp make_pair
#define MAXN 1024
#define MOD 10000003
#define MOD2 1000003
#define MOD3 2000003

typedef struct dreapta { int a, b, c; } dreapta;
typedef struct point { int x, y; } point;

int N, M, res;
dreapta D[MAXN];
point P[MAXN];
map< pair<int, pair<int, int> >, char> Ok;

int F(dreapta d, point p)
{
    int t = d.a*p.x+d.b*p.y+d.c;
    return t > 0 ? 1 : -1;
}

void solve(void)
{
    int i, j, k1, k2, k3, sgn;

    for(i = 1; i <= M; i++)
    {
        for(k1 = k2 = k3 = 0, j = 1; j <= N; j++)
        {
            sgn = F(D[j], P[i]);
            if(sgn == 1)
            {
                k1 = (k1*2+1) % MOD,
                k2 = (k2*2+1) % MOD2,
                k3 = (k3*2+1) % MOD3;
            }
            else
            {
                k1 = (k1*2+0) % MOD,
                k2 = (k2*2+0) % MOD2,
                k3 = (k3*2+0) % MOD3;
            }
        }
        if(!Ok[ mp(k1, mp(k2,k3)) ])
            res++, Ok[ mp(k1, mp(k2,k3)) ] = 1;
    }
}

void read_data(void)
{
    int i, j;

    scanf("%d %d\n", &N, &M);

    for(i = 1; i <= N; i++)
        scanf("%d %d %d\n", &D[i].a, &D[i].b, &D[i].c);

    for(i = 1; i <= M; i++)
        scanf("%d %d\n", &P[i].x, &P[i].y);
}

void write_data(void)
{
    printf("%d\n", res);
}

int main(void)
{
    freopen("regiuni.in", "rt", stdin);
    freopen("regiuni.out", "wt", stdout);

    read_data();
    solve();
    write_data();

    return 0;
}