#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
ifstream cin("regiuni.in");
ofstream cout("regiuni.out");
int rez,X,Y,n,m,nr;
struct chestie{
char sir[1100];
bool operator ==(chestie B)
{
    int n=strlen(sir),m=strlen(B.sir);
    if(n<m)
        return 0;
    if(n>m)
        return 0;
    for(int i=0;i<n;i++)
        if(sir[i]!='0'&&B.sir[i]!='0')
    {   if(sir[i]<B.sir[i])
            return 0;
        if(sir[i]>B.sir[i])
            return 0;}
    return 1;
}
bool operator <(chestie B)
{
    int n=strlen(sir),m=strlen(B.sir);
    if(n<m)
        return 1;
    if(n>m)
        return 0;
    for(int i=0;i<n;i++)
        if(sir[i]!='0'&&B.sir[i]!='0')
    {   if(sir[i]<B.sir[i])
            return 1;
        if(sir[i]>B.sir[i])
            return 0;}
    return 0;
}

bool operator >(chestie B)
{
    int n=strlen(sir),m=strlen(B.sir);
    if(n<m)
        return 0;
    if(n>m)
        return 1;
    for(int i=0;i<n;i++)
        if(sir[i]!='0'&&B.sir[i]!='0')
    {   if(sir[i]<B.sir[i])
            return 0;
        if(sir[i]>B.sir[i])
            return 1;}
    return 0;
}
}s[1100];
struct cealaltachestie{
int a,b,c;
}dr[1100];
bool comp(chestie A,chestie B);
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>dr[i].a>>dr[i].b>>dr[i].c;
    for(int i=1;i<=m;i++)
    {
        cin>>X>>Y;s[i].sir[0]='0';
        for(int j=1;j<=n;j++)
        {
            rez=X*dr[j].a+Y*dr[j].b+dr[j].c;
            if(rez==0) s[i].sir[j-1]='0';
            else if(rez<0) s[i].sir[j-1]='2';
            else s[i].sir[j-1]='1';
        }
        s[i].sir[n]='\0';
    }
    sort(s+1,s+m+1,comp);
    nr=n;
    for(int i=1;i<m;i++)
    {
        if(s[i].sir==s[i+1].sir)
            nr--;
    }
    cout<<nr<<'\n';
    return 0;
}
bool comp(chestie A,chestie B)
{
    return (A.sir<B.sir);
}