#pragma GCC target("popcnt")
#define atsum(l, r) accumulate(l, r, 0)
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
inline void chkmin(T &x, T y) {
    x = min(x, y);
}
template <typename T>
inline void chkmax(T &x, T y) {
    x = max(x, y);
}
namespace FastIO {
// ------------------------------
#define IN_HAS_NEG
#define OUT_HAS_NEG
#define CHK_EOF
#define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if (defined(LOCAL) || defined(_WIN32)) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include <sys/mman.h>
#endif
#ifdef LOCAL
inline char gc() { return getchar(); }
inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
INLINE_V constexpr int _READ_SIZE = 1 << 18;
INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr,
                                               *_read_ptr_end = nullptr;
inline char gc() {
    if (__builtin_expect(_read_ptr == _read_ptr_end, false)) {
        _read_ptr = _read_buffer;
        _read_ptr_end =
            _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
        if (__builtin_expect(_read_ptr == _read_ptr_end, false)) return EOF;
#endif
    }
    return *_read_ptr++;
}
#else
INLINE_V static const char *_read_ptr =
    (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
inline char gc() { return *_read_ptr++; }
#endif
INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
inline void pc(char c) {
    *_write_ptr++ = c;
    if (__builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false)) {
        fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
        _write_ptr = _write_buffer;
    }
}
INLINE_V struct _auto_flush {
    ~_auto_flush() {
        fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
    }
} _auto_flush;
#endif
#ifdef CHK_EOF
inline bool _isdigit(char c) { return (c & 16) && c != EOF; }
inline bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
inline bool _isdigit(char c) { return c & 16; }
inline bool _isgraph(char c) { return c > 32; }
#endif
template <class T>
INLINE_V constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <class T>
INLINE_V constexpr bool _is_signed = numeric_limits<T>::is_signed;
template <class T>
INLINE_V constexpr bool _is_unsigned = _is_integer<T> && !_is_signed<T>;
template <>
INLINE_V constexpr bool _is_integer<__int128> = true;
template <>
INLINE_V constexpr bool _is_integer<__uint128_t> = true;
template <>
INLINE_V constexpr bool _is_signed<__int128> = true;
template <>
INLINE_V constexpr bool _is_unsigned<__uint128_t> = true;
#undef INLINE_V
inline void read(char &c) {
    do c = gc();
    while (!_isgraph(c));
}
inline void read_cstr(char *s) {
    char c = gc();
    while (!_isgraph(c)) c = gc();
    while (_isgraph(c)) *s++ = c, c = gc();
    *s = 0;
}
inline void read(string &s) {
    char c = gc();
    s.clear();
    while (!_isgraph(c)) c = gc();
    while (_isgraph(c)) s.push_back(c), c = gc();
}
#ifdef IN_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void read(T &x) {
    char c = gc();
    bool f = true;
    x = 0;
    while (!_isdigit(c)) {
        if (c == 45) f = false;
        c = gc();
    }
    if (f)
        while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
    else
        while (_isdigit(c)) x = x * 10 - (c & 15), c = gc();
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void read(T &x) {
    char c = gc();
    while (!_isdigit(c)) c = gc();
    x = 0;
    while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
}
inline void write(char c) { pc(c); }
inline void write_cstr(const char *s) {
    while (*s) pc(*s++);
}
inline void write(const string &s) {
    for (char c : s) pc(c);
}
#ifdef OUT_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void write(T x) {
    char buffer[numeric_limits<T>::digits10 + 1];
    int digits = 0;
    if (x >= 0) do
            buffer[digits++] = (x % 10) | 48, x /= 10;
        while (x);
    else {
        pc(45);
        do buffer[digits++] = -(x % 10) | 48, x /= 10;
        while (x);
    }
    while (digits) pc(buffer[--digits]);
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void write(T x) {
    char buffer[numeric_limits<T>::digits10 + 1];
    int digits = 0;
    do buffer[digits++] = (x % 10) | 48, x /= 10;
    while (x);
    while (digits) pc(buffer[--digits]);
}
template <int N>
struct _tuple_io_helper {
    template <class... T>
    static inline void _read(tuple<T...> &x) {
        _tuple_io_helper<N - 1>::_read(x), read(get<N - 1>(x));
    }
    template <class... T>
    static inline void _write(const tuple<T...> &x) {
        _tuple_io_helper<N - 1>::_write(x), pc(32), write(get<N - 1>(x));
    }
};
template <>
struct _tuple_io_helper<1> {
    template <class... T>
    static inline void _read(tuple<T...> &x) {
        read(get<0>(x));
    }
    template <class... T>
    static inline void _write(const tuple<T...> &x) {
        write(get<0>(x));
    }
};
template <class... T>
inline void read(tuple<T...> &x) {
    _tuple_io_helper<sizeof...(T)>::_read(x);
}
template <class... T>
inline void write(const tuple<T...> &x) {
    _tuple_io_helper<sizeof...(T)>::_write(x);
}
template <class T1, class T2>
inline void read(pair<T1, T2> &x) {
    read(x.first), read(x.second);
}
template <class T1, class T2>
inline void write(const pair<T1, T2> &x) {
    write(x.first), pc(32), write(x.second);
}
template <class T1, class... T2>
inline void read(T1 &x, T2 &...y) {
    read(x), read(y...);
}
template <class... T>
inline void read_cstr(char *x, T *...y) {
    read_cstr(x), read_cstr(y...);
}
template <class T1, class... T2>
inline void write(const T1 &x, const T2 &...y) {
    write(x), write(y...);
}
template <class... T>
inline void write_cstr(const char *x, const T *...y) {
    write_cstr(x), write_cstr(y...);
}
template <class T>
inline void print(const T &x) {
    write(x);
}
inline void print_cstr(const char *x) { write_cstr(x); }
template <class T1, class... T2>
inline void print(const T1 &x, const T2 &...y) {
    print(x), pc(32), print(y...);
}
template <class... T>
inline void print_cstr(const char *x, const T *...y) {
    print_cstr(x), pc(32), print_cstr(y...);
}
inline void println() { pc(10); }
inline void println_cstr() { pc(10); }
template <class... T>
inline void println(const T &...x) {
    print(x...), pc(10);
}
template <class... T>
inline void println_cstr(const T *...x) {
    print_cstr(x...), pc(10);
}
}  // namespace FastIO
using namespace FastIO;
template <typename T>
inline void clear(T &x) {
    T y;
    swap(x, y);
}
const int N = 5e4 + 10;
const int V = 10;
struct BIT {
    __uint128_t w[(N >> 7) + 1];
    int len;
    int cc;
    unsigned *g = (unsigned *)w;
    inline void reset() {
        cc = 0;
        memset(w, 0, sizeof(w));
    }
    inline bool test(int u) { return g[(u >> 5)] & (1u << (u & 31)); }
    inline void set(int u) { g[u >> 5] ^= 1u << (u & 31); }
    inline int count(int l, int r) {
        int res = 0;
        if ((l >> 5) == (r >> 5)) {
            if (!(l & 31) && (r & 31) == 31)
                return __builtin_popcount(g[l >> 5]);
            return __builtin_popcount((g[(l >> 5)] >> (l & 31)) &
                                      ((1u << (r - l + 1)) - 1));
        }
        while (l & 31)
            res += __builtin_popcount(g[l >> 5] >> (l & 31)),
                l += 32 - (l & 31);
        while ((r & 31) != 31)
            res += __builtin_popcount(g[r >> 5] & ((1u << (r & 31) + 1) - 1)),
                r -= 1 + (r & 31);
        l >>= 5, r >>= 5;
        for (int i = l; i <= r; i++) res += __builtin_popcount(g[i]);
        return res;
    }
    inline BIT operator|(BIT b) {
        BIT ans;
#pragma GCC unroll 32
        for (int i = 0; i <= len; i++) ans.w[i] = w[i] | b.w[i];
        ans.cc = cc + b.cc;
        return ans;
    }
    inline void operator|=(BIT b) {
        cc += b.cc;
#pragma GCC unroll 32
        for (int i = 0; i <= len; i++) w[i] |= b.w[i];
    }
} f[V + 2][V + 2], c, f2[V + 2][V + 2];
tuple<int, int, int> vec[V + 2][V + 2][N];
tuple<int, int, int> vec2[V + 2][V + 2][N];
int siz[V + 2][V + 2];
int n, m;
ll A, B, C;
inline bool judge(int x, int y) { return A * x + B * y < C; }
int xmn[V + 2][V + 2], xmx[V + 2][V + 2], ymn[V + 2][V + 2], ymx[V + 2][V + 2];
int cx[N], cy[N], cz[N], xmin = inf, xmax = -inf, ymin = inf, ymax = -inf;
int xl[V + 2], yl[V + 2], xr[V + 2], yr[V + 2];
int x[N], y[N], col[N], id[N], cc[N];
bool used[V + 2][V + 2];
bool vis[N];
int pr[N];
int main() {
    read(n, m);
    // assert(m <= 1000);
    memset(xmn, 0x3f, sizeof(xmn));
    memset(ymn, 0x3f, sizeof(ymn));
    memset(xmx, -0x3f, sizeof(xmx));
    memset(ymx, -0x3f, sizeof(ymx));
    for (int i = 1; i <= n; i++)
        id[i] = i, read(cx[i], cy[i], cz[i]), ++cc[cz[i]], chkmin(xmin, cx[i]),
        chkmax(xmax, cx[i]), chkmin(ymin, cy[i]), chkmax(ymax, cy[i]);
    sort(id + 1, id + n + 1, [&](int x, int y) {
        return cc[cz[x]] != cc[cz[y]] ? cc[cz[x]] > cc[cz[y]] : cz[x] < cz[y];
    });
    for (int i = 1; i <= n; i++)
        x[i] = cx[id[i]], y[i] = cy[id[i]], col[i] = cz[id[i]];
    for (int i = 1; i <= n; i++) vis[i] = (col[i] != col[i - 1]);
    int res = 0;
    for (int i = 1; i <= n; i++) res += cc[i] >= 2;
    int pdis = (xmax - xmin) / V + 1;
    int rpos = 0;
    for (int i = 1; i <= n; i++)
        if (cc[col[i]] > 1) rpos = i;
    int qdis = (ymax - ymin) / V + 1;
    int c0 = 0;
    for (int l = 1, r; l <= rpos; l = r + 1) {
        r = l;
        while (r <= n && col[r + 1] == col[l]) ++r;
        pr[l] = r;
    }
    for (int l = xmin, r; c0 < V; l = r + 1) {
        r = l + pdis - 1;
        ++c0, xl[c0] = l, xr[c0] = r;
    }
    c0 = 0;
    for (int l = ymin, r; c0 < V; l = r + 1) {
        r = l + qdis - 1;
        ++c0, yl[c0] = l, yr[c0] = r;
    }
    for (int i = 0; i < (V + 2); i++)
        for (int j = 0; j < V + 2; j++)
            f[i][j].len = (rpos + 1 >> 7), f2[i][j].len = (rpos + 1 >> 7);
    c.len = (rpos + 1 >> 7);
    for (int i = 1; i <= n; i++) {
        int ppos = 0, qpos = 0;
        for (int c = 1; c <= V; c++)
            if (xl[c] <= x[i] && x[i] <= xr[c]) {
                for (int j = 1; j <= V; j++)
                    if (yl[j] <= y[i] && y[i] <= yr[j]) {
                        used[c][j] = 1;
                        if (cc[col[i]] > 1) {
                            f[c][j].set(i);
                            vec[c][j][++siz[c][j]] = {x[i], y[i], i};
                            vec2[c][j][siz[c][j]] = {y[i], x[i], i};
                        } else {
                            ++f[c][j].cc;
                            vec[c][j][++siz[c][j]] = {x[i], y[i], 0};
                            vec2[c][j][siz[c][j]] = {y[i], x[i], 0};
                        }
                        chkmin(xmn[c][j], x[i]), chkmax(xmx[c][j], x[i]);
                        chkmin(ymn[c][j], y[i]), chkmax(ymx[c][j], y[i]);
                    }
                break;
            }
    }
    for (int c1 = 1; c1 <= V; c1++)
        for (int c2 = 1; c2 <= V; c2++) {
            sort(vec[c1][c2] + 1, vec[c1][c2] + siz[c1][c2] + 1);
            sort(vec2[c1][c2] + 1, vec2[c1][c2] + siz[c1][c2] + 1);
        }
    for (int c1 = 1; c1 <= V; c1++)
        for (int c2 = V; c2; c2--) f2[c1][c2] = f[c1][c2] | f2[c1][c2 + 1];
    for (int c1 = 1; c1 <= V; c1++)
        for (int c2 = 1; c2 <= V; c2++) f[c1][c2] = f[c1][c2] | f[c1][c2 - 1];

    // m /= 5;
    while (m--) {
        c.reset();
        read(A, B, C), C = -C;
        for (int i = 1; i <= V; i++) {
            int l = inf, r = 0;
            for (int j = 1; j <= V; j++) {
                if (judge(xl[i], yl[j]) && judge(xl[i], yr[j]) &&
                    judge(xr[i], yl[j]) && judge(xr[i], yr[j])) {
                    // c |= f[i][j];
                    chkmax(r, j), chkmin(l, j);
                    continue;
                }
                if (!judge(xl[i], yl[j]) && !judge(xl[i], yr[j]) &&
                    !judge(xr[i], yl[j]) && !judge(xr[i], yr[j])) {
                    continue;
                }
                if (!siz[i][j]) continue;
                ll tk = min(yl[j] * B, yr[j] * B);
                int pal, par;
                int pbl, pbr;
                if (A > 0) {
                    int L = 1, R = siz[i][j], ans = 0;
                    while (L <= R) {
                        int M = L + R >> 1;
                        if (get<0>(vec[i][j][M]) * A + tk < C)
                            ans = M, L = M + 1;
                        else
                            R = M - 1;
                    }
                    pal = 1, par = ans;
                } else {
                    int L = 1, R = siz[i][j], ans = siz[i][j] + 1;
                    while (L <= R) {
                        int M = L + R >> 1;
                        if (get<0>(vec[i][j][M]) * A + tk < C)
                            ans = M, R = M - 1;
                        else
                            L = M + 1;
                    }
                    pal = ans, par = siz[i][j];
                }
                ll tk2 = min(xl[i] * A, xr[i] * A);
                if (B > 0) {
                    int L = 1, R = siz[i][j], ans = 0;
                    while (L <= R) {
                        int M = L + R >> 1;
                        if (get<0>(vec2[i][j][M]) * B + tk2 < C)
                            ans = M, L = M + 1;
                        else
                            R = M - 1;
                    }
                    pbl = 1, pbr = ans;
                } else {
                    int L = 1, R = siz[i][j], ans = siz[i][j] + 1;
                    while (L <= R) {
                        int M = L + R >> 1;
                        if (get<0>(vec2[i][j][M]) * B + tk2 < C)
                            ans = M, R = M - 1;
                        else
                            L = M + 1;
                    }
                    pbr = siz[i][j], pbl = ans;
                }
                if (par - pal < pbr - pbl) {
                    for (int k = pal; k <= par; k++)
                        if (judge(get<0>(vec[i][j][k]), get<1>(vec[i][j][k]))) {
                            if (get<2>(vec[i][j][k]))
                                c.set(get<2>(vec[i][j][k]));
                            else
                                ++c.cc;
                        }
                } else {
                    for (int k = pbl; k <= pbr; k++)
                        if (judge(get<1>(vec2[i][j][k]), get<0>(vec2[i][j][k]))) {
                            if (get<2>(vec2[i][j][k]))
                                c.set(get<2>(vec2[i][j][k]));
                            else
                                ++c.cc;
                        }
                }
            }
            if (l <= r) {
                if (l == 1)
                    c |= f[i][r];
                else if (r == V)
                    c |= f2[i][l];
            }
        }
        // println(c.count());
        ll ans = c.cc;
        int cc = 0;
        for (int i = 1; i <= rpos; i = pr[i] + 1) {
            // if (vis[i]) cc = 0;
            // if (c.test(i)) ans += ++cc;
            ll k = c.count(i, pr[i]);
            ans += k * k;
        }
        println(ll(ans));
    }
    return 0;
}