#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <unordered_set>
#define maxN 1002
#define mod 66666013
using namespace std;
int n, m, i, j, x, y;
struct line
{
    int a;
    int b;
    int c;
}v[maxN];
unordered_set < int > s;
void read()
{
    freopen("regiuni.in", "r", stdin);
    scanf("%d %d", &n, &m);
    for (i = 1; i <= n; ++ i)
        scanf("%d %d %d", &v[i].a, &v[i].b, &v[i].c);
}
int f(int i, int x, int y)
{
    return v[i].a * x + v[i].b * y + v[i].c > 0;
}
void solve()
{
    for (i = 1; i <= m; ++ i)
    {
        scanf("%d %d", &x, &y);
        int val = 0;
        for (j = 1; j <= n; ++ j)
            val = (val * 2 + f(j, x, y)) % mod;
        s.insert(val);
    }
}
void write()
{
    freopen("regiuni.out", "w", stdout);
    printf("%d", s.size());
}
int main()
{
    read();
    solve();
    write();
    return 0;
}