#include <fstream>
#include <cmath>
#include <vector>
#include <iomanip>
#include <queue>
#include <cstring>
#include <algorithm>
#include <queue>
#include <unordered_set>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
using namespace std;

ifstream cin("regiuni.in");
ofstream cout("regiuni.out");

const int MAXN = 1000;

class Line {
    public:
        Line(int _a = 0, int _b = 0, int _c = 0):
            a(_a),
            b(_b),
            c(_c) {}

        int Evaluate(int x, int y) {
            return a * x + b * y + c;
        }
    private:
        int a;
        int b;
        int c;
};
Line lines[1 + MAXN];
bitset<1 + MAXN> value;
unordered_set<bitset<1 + MAXN> > points;

int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        lines[i] = Line(a, b, c);
    }
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        for (int j = 1; j <= n; j++)
            value[j] = (lines[j].Evaluate(x, y) > 0);
        points.insert(value);
    }
    cout << points.size();
    return 0;
}