// while (clock()<=69*CLOCKS_PER_SEC)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("O3")
// #pragma GCC target ("avx2")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
// #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <cmath>
// #include <functional>
// #include <fstream>
// #include <algorithm>
// #include <string>
// #include <set>
// #include <map>
// #include <list>
// #include <time.h>
// #include <math.h>
// #include <random>
// #include <deque>
// #include <queue>
// #include <cassert>
// #include <unordered_map>
// #include <unordered_set>
// #include <iomanip>
// #include <bitset>
// #include <sstream>
// #include <chrono>
// #include <cstring>
#include <cstdio>
#include <vector>
#include <string>

using namespace std;

typedef long long ll;
typedef long double ld;
///mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
bool HOME = 1;
const string TASK_NAME = "regiuni";
#define files(TASK_NAME) read(TASK_NAME); write(TASK_NAME)
#define read(TASK_NAME) freopen((TASK_NAME + ".in").c_str(), "r", stdin)
#define write(TASK_NAME) freopen((TASK_NAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int) (c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228

const int N = 1000 + 7;
int m, n, a[N], b[N], c[N], x[N], y[N], cnt = 1;
vector<int> who[N];

int f(int i, int j) {
  return (a[i] * (ll) x[j] + b[i] * (ll) y[j] + c[i] > 0);
}

int main() {
#ifdef INFOARENA
    HOME = 0;
#endif
  if (HOME) {
    freopen ("input", "r", stdin);
  } else {
    files(TASK_NAME);
  }
  scanf("%d %d", &m, &n);
  for (int i = 1; i <= m; i++) {
    scanf("%d %d %d", &a[i], &b[i], &c[i]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d %d", &x[i], &y[i]);
    who[1].push_back(i);
  }
  for (int i = 1; i <= m; i++) {
    int cnt2 = cnt;
    for (int it = 1; it <= cnt; it++) {
      vector<int> a, b;
      for (auto &j : who[it]) {
        if (f(i, j)) {
          a.push_back(j);
        } else {
          b.push_back(j);
        }
      }
      if (a.empty() || b.empty()) {
        continue;
      }
      who[it] = a;
      who[++cnt2] = b;
    }
    cnt = cnt2;
  }
  printf("%d\n", cnt);
  return 0;
}