#include <cstdio>
#include <algorithm>

#define NMAX 1007
#define Mod 12998111

using namespace std;

int n, m;
int a[NMAX], b[NMAX], c[NMAX], v[NMAX], A[NMAX], B[NMAX];
int Num;

int main(){
    freopen("regiuni.in", "r", stdin);
    freopen("regiuni.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++i)
        scanf("%d %d %d", &a[i], &b[i], &c[i]);
    for(int i = 1; i <= m; ++i)
        scanf("%d %d", &A[i], &B[i]);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            if(a[i] * A[j] + b[i] * B[j] + c[i] > 0)
                v[j] = (v[j] * 10 + 1) % Mod;
            else
                v[j] = (v[j] * 10 + 2) % Mod;
    v[0] = -1;
    sort(v + 1, v + m + 1);
    for(int i = 1; i <= m; ++i)
        if(v[i] != v[i - 1])
            ++Num;
    printf("%d\n", Num);
    return 0;
}