#include <cstdio>
#include <algorithm>

using namespace std;

#define Nmax 1024
#define Tmax 12289
#define r 98317
#define a first
#define b second.first
#define c second.second
#define x first
#define y second
#define pb push_back
#define sz size()

int n, m, ct;
pair<short, pair<short, short> > dr[Nmax];
pair<short, short> punct[Nmax];
char T[Tmax], v[Nmax];

void citire()
{
    int i, p1, p2, p3;
    
    scanf("%d %d\n", &n, &m);
    
    for (i = 1; i <= n; ++i)
    {
        scanf("%d %d %d\n", &p1, &p2, &p3);
        dr[i].a = p1;
        dr[i].b = p2;
        dr[i].c = p3;
    }
    
    for (i = 1; i <= m; ++i)
    {
        scanf("%d %d\n", &p1, &p2);
        punct[i].x = p1;
        punct[i].y = p2;
    }
}

void solve()
{
    int i, j, hash, ct = 0;
    
    for (i = 1; i <= m; ++i)
    {
        for (j = 1; j <= n; ++j)
            if (int(dr[j].a) * punct[i].x + dr[j].b * punct[i].y + dr[j].c > 0)
                v[j] = 1;
            else
                v[j] = 0;
        
        hash = 0;
        
        for (j = 1; j <= m; ++j)
        {
            hash = hash * r + v[j];
            hash %= Tmax;
        }
        
        if (!T[hash])
        {
            T[hash] = 1;
            ++ct;
        }
    }
    
    printf("%d\n", ct);
}

int main()
{
    freopen("regiuni.in", "r", stdin);
    freopen("regiuni.out", "w", stdout);
    citire();
    solve();
    return 0;
}