#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<string.h>
using namespace std;

#define NMAX 1001

struct punct
{
    short int x,y;
}v[NMAX];
struct dreapta
{
    short int a,b,c;
}d[NMAX];
struct grupa
{
    short int g,n;
}f[NMAX];


int n,m,nr;
short viz[NMAX];

inline bool cmp(const grupa &a,const grupa &b)
{
    return a.g<b.g;
}

inline bool dist(const dreapta &d,const punct &p)
{
    return ((int)d.a*(int)p.x + (int)d.b*(int)p.y+(int)d.c) / sqrt((int)d.a*(int)d.a + (int)d.b*(int)d.b) > 0;
}

int main()
{
    freopen("regiuni.in","r",stdin);
    freopen("regiuni.out","w",stdout);
    short int i,j,sol=0;

    nr=1;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
        scanf("%d%d%d",&d[i].a,&d[i].b,&d[i].c);
    for(i=1;i<=m;++i)
    {
        scanf("%d%d",&v[i].x,&v[i].y);

        f[i].g=nr;
        f[i].n=i;
    }

    for(i=1;i<=n;++i)
    {
        memset(viz,0,sizeof(viz));
        for(j=1;j<=m;++j)
        {
            if(!viz[f[j].g])
                viz[f[j].g]=(++nr);

            if(dist(d[i],v[f[j].n]))
                f[j].g=viz[f[j].g];
        }
    }


    sort(f,f+1+n,cmp);
    for(i=1;i<=m;++i)
        if(f[i].g!=f[i-1].g)
            ++sol;

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

    return 0;
}