#include <bits/stdc++.h>
using namespace std;
ifstream f ("regiuni.in");
ofstream g ("regiuni.out");
struct gioto
{
    int a,b,c;
}v[1013];
unordered_set <bitset <1013> > usu;
int n,m,x,y;
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;++i) f>>v[i].a>>v[i].b>>v[i].c;
    while(m--)
    {
        f>>x>>y;
        bitset <1002> act;
        for(int i=1;i<=n;++i) act[i]=(v[i].a*x+v[i].b*y+v[i].c)>0;
        usu.insert(act);
    }
    g<<usu.size();
    return 0;
}