#include <fstream>
#include <unordered_map>
#define VAL 1005

using namespace std;

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

short int N, M, i, j;
short int A[VAL], B[VAL];
short int C[VAL], X, Y;
int Sum;
string S;
unordered_map <string, bool> Hash;

int main()
{
    fin >> N >> M;
    for (i=1; i<=N; i++)
      fin >> A[i] >> B[i] >> C[i];
    for (i=1; i<=M; i++)
    {
        fin >> X >> Y;
        S.clear();
        for (j=1; j<=N; j++)
        {
            Sum=int(A[j]*X)+int(B[j]*Y)+C[j];
            if (Sum>0)
              S+='+';
            else
              S+='-';
        }
        Hash[S]=true;
    }
    fout << Hash.size() << '\n';
    fin.close();
    fout.close();
    return 0;
}