#include <bits/stdc++.h>
#define mod 1000099
using namespace std;

ifstream fin("regiuni.in");
ofstream fout("regiuni.out");

unordered_map <int,int>M;
int a[1005],b[1005],c[1005];
int n,m,cnt;

int main()
{
    int i,j,k,x,y;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>a[i]>>b[i]>>c[i];
    for(j=1;j<=m;j++)
    {
        k=0;
        fin>>x>>y;
        for(i=1;i<=n;i++)
        {
            k*=2;
            if(x*a[i]+y*b[i]+c[i]>0)k++;
            k%=mod;
        }
        M[k]++;
    }
    for(auto j:M)
        if(j.second>0)cnt++;
    fout<<cnt;
    return 0;
}