#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;

const int NMAX = 1010, MOD1 = 100007, MOD2 = 100021;

int N, M, A[NMAX], B[NMAX], C[NMAX], X, Y, C1[NMAX], C2[NMAX], Ans;

int main()
{
    freopen("regiuni.in", "r", stdin);
    freopen("regiuni.out", "w", stdout);

    scanf("%i %i", &N, &M);
    for(int i = 1; i <= N; ++ i) scanf("%i %i %i", &A[i], &B[i], &C[i]);
    for(int i = 1; i <= M; ++ i)
    {
        scanf("%i %i", &X, &Y);
        for(int j = 1; j <= N; ++ j)
        {
            int Sign = (A[j] * X + B[j] * Y + C[j]) > 0;
            C1[i] = (C1[i] * 2 + Sign) % MOD1;
            C2[i] = (C2[i] * 2 + Sign) % MOD2;
        }
    }
    for(int i = 1; i <= M; ++ i)
    {
        bool NewRegion = 1;
        for(int j = 1; j < i && NewRegion; ++ j)
            if(C1[i] == C1[j] && C2[i] == C2[j])
                NewRegion = 0;
        Ans += NewRegion;
    }
    printf("%i\n", Ans);
}