#include <stdio.h>
#include <string>

using namespace std;

#define MAX_N 1024
#define FIN "regiuni.in"
#define FOUT "regiuni.out"

int N, M, A[MAX_N], B[MAX_N], C[MAX_N];
string S[MAX_N];

int main(void)
{
    int i, j, x, y, t;

    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);

    scanf("%d %d", &N, &M);
    for (i = 0; i < N; i++)
        scanf("%d %d %d", A+i, B+i, C+i);

    for (i = 0; i < M; i++)
    {
        scanf("%d %d", &x, &y);
        for (j = 0; j < N; j++)
        {
            t = A[j]*x + B[j]*y + C[j] < 0 ? '1' : '0';
            S[i] += t;
        }
    }

    sort(S, S+M);
    M = unique(S, S+M)-S;

    printf("%d\n", M);

    return 0;
}