#include<fstream>
#include<vector>
#include<bitset>
#include<unordered_map>
#include<algorithm>

using namespace std;
typedef int var;

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

const var MAXN = 1001;
const var P1 = 666013,
          P2 = 123201,
          P3 = 9381;


vector<var> A, B, C;


inline bool is_above(const var &x, const var &y, const var &ind) {
    return A[ind]*x + B[ind]*y + C[ind] > 0;
}


vector<var> H;

int main() {
    var n, m, x, y;
    fin>>n>>m;

    A.resize(n+1, 0);
    B.resize(n+1, 0);
    C.resize(n+1, 0);

    var i, j;
    bool rez;

    for(i=1; i<=n; i++) {
        fin>>A[i]>>B[i]>>C[i];
    }

    var val1, val2;

    for(i=1; i<=m; i++) {
        fin>>x>>y;
        val1 = val2 = 0;
        for(j=1; j<=n; j++) {
            rez = is_above(x, y, j);
            val1 = val1*2 + rez;
            val2 = val2*2 + rez;
            val1 %= P1;
            val2 %= P2;
        }
        if(find(H.begin(), H.end(), val1*P3+val2) == H.end()) {
            H.push_back(val1*P3+val2);
        }
    }

    fout<<H.size();

    return 0;
}