#include <fstream>
#include <unordered_set>
#include <bitset>
#include <vector>

using namespace std;
#define llu long long unsigned
#define ll long long
#define pb push_back
#define mp make_pair

string problemName = "regiuni";
string inFile = problemName+".in";
string outFile = problemName+".out";
ifstream fin(inFile.c_str());
ofstream fout(outFile.c_str());

const int N = 1005;

struct dr{
    int a,b,c;
}v[N];

unordered_set < bitset<N> > s;

int main(){
    int n,m,i,j,x,y;
    fin>>n>>m;
    for(i = 1;i <= n;i++){
        fin>>v[i].a>>v[i].b>>v[i].c;
    }
    vector < bitset<N> > all(m+1, 0);
    for(i = 1;i <= m;i++){
        fin>>x>>y;
        for(j = 1;j <= m;j++){
            all[i][j] = (v[j].a * x + v[j].b * y + v[j].c) > 0;
        }
    }
    for(auto it : all){
        s.insert(it);
    }
    fout<<s.size();
    return 0;
}