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

#define NMAX 1002

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



int n,m,nr;
short viz[NMAX];//,last[NMAX];
short int f[NMAX];
char tip[NMAX];

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) > 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]=nr;
        viz[i]=1;
    }

    for(i=1;i<=n;++i)
    {
        memset(viz,0,sizeof(viz));
        memset(tip,0,sizeof(tip));
        for(j=1;j<=m;++j)
        {
            if(dist(d[i],v[j]))
            {
                if(!tip[f[j]])
                {
                    tip[f[j]]=1;
                    continue;
                }
                if(tip[f[j]]==1)
                    continue;

                if(viz[f[j]]==0)
                    viz[f[j]]=(++nr);
                f[j]=viz[f[j]];
            }
            else
            {
                if(!tip[f[j]])
                    tip[f[j]]=2;
                else if(tip[f[j]]==1)
                {
                    if(viz[f[j]]==0)
                        viz[f[j]]=(++nr);
                    f[j]=viz[f[j]];
                }
            }
        }
    }


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

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

    return 0;
}