#include <cstdio>
#include <algorithm>

#define NMAX 1001
#define Mod 666013

using namespace std;

int n, m;
short int a[NMAX], b[NMAX], c[NMAX], v[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\n", &a[i], &b[i], &c[i]);
    for(int i = 1; i <= m; ++i){
        int A, B, Ans = 0;
        scanf("%d %d\n", &A, &B);
        for(int k = 1; k <= n; ++k)
            if(a[k] * A + b[k] * B + c[k] < 0)
                v[i] = (v[i] * 3 + 2) % Mod;
            else
                v[i] = (v[i] * 3 + 1) % Mod;
    }
    sort(v + 1, v + m + 1);
    for(int i = 1; i < m; ++i)
        if(v[i] != v[i + 1])
            ++Num;
    printf("%d\n", Num + 1);
    return 0;
}