// #define LOCAL
// #define DEBUG
// #define DEBUG__
#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
// ------------------------------
#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), 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, M = 5e5 + 10;
int n, m;
ll col[N];
ll finalans[M];
namespace DATA {
struct Frac {
    ll x, y;
    inline Frac(ll _x, ll _y) {
        x = _x, y = _y;
        if (y < 0) x = -x, y = -y;
        assert(_y);
    }
    inline Frac() { x = 0, y = 1; }
    inline bool operator<(Frac b) const { return x * b.y < b.x * y; }
    inline bool operator<=(Frac b) const { return x * b.y <= b.x * y; }

    inline bool operator>(Frac b) const { return x * b.y > b.x * y; }
    inline bool operator==(Frac b) const { return x * b.y == b.x * y; }
    inline bool operator!=(Frac b) const { return x * b.y != b.x * y; }
};
struct Point {
    ll x, y;
    int col;
};
struct Querya {
    ll a, b, c;
    int id;
    inline bool operator<(Querya _) const { return id < _.id; }
    inline bool countain(Point r) { return -r.x * a + r.y * b + c < 0; }
};
};  // namespace DATA
using namespace DATA;
Point a[N];
double T_sum, T_sum2;
ll nans = 0;
// task
namespace WATER_SCANLINE {
vector<Querya> q;
inline void solve() {
    vector<Querya> x;
    for (auto _ : q)
        if (_.a > 0) x.emplace_back(_);
    sort(x.begin(), x.end(), [&](Querya x, Querya y) {
        return Frac{-x.c, x.a} < Frac{-y.c, y.a};
    });
    sort(a + 1, a + n + 1, [&](Point x, Point y) { return x.x < y.x; });
    int r = 1;
    memset(col, 0, sizeof(col)), nans = 0;
    for (auto [aa, b, c, id] : x) {
        while (r <= n && Frac{a[r].x, 1} < Frac{-c, aa}) {
            int c = a[r].col;
            nans -= 1ll * col[c] * col[c], ++col[a[r].col];
            nans += 1ll * col[c] * col[c], ++r;
        }
        finalans[id] = nans;
    }
    memset(col, 0, sizeof(col)), nans = 0, clear(x);
    for (auto _ : q)
        if (_.a < 0) x.emplace_back(_);
    sort(x.begin(), x.end(), [&](Querya x, Querya y) {
        return Frac{x.c, -x.a} > Frac{y.c, -y.a};
    });
    sort(a + 1, a + n + 1, [&](Point x, Point y) { return x.x > y.x; }), r = 1;
    for (auto [aa, b, c, id] : x) {
        while (r <= n && Frac{a[r].x, 1} > Frac{-c, aa}) {
            int c = a[r].col;
            nans -= 1ll * col[c] * col[c], ++col[a[r++].col];
            nans += 1ll * col[c] * col[c];
        }
        finalans[id] = nans;
    }
}
};  // namespace WATER_SCANLINE
namespace SHU_SCANLINE {
vector<Querya> q;
inline void solve() {
    vector<Querya> x;
    for (auto _ : q)
        if (_.b > 0) x.emplace_back(_);
    sort(x.begin(), x.end(), [&](Querya x, Querya y) {
        return Frac{-x.c, x.b} < Frac{-y.c, y.b};
    });
    sort(a + 1, a + n + 1, [&](Point x, Point y) { return x.y < y.y; });
    int r = 1;
    memset(col, 0, sizeof(col)), nans = 0;
    for (auto [aa, b, c, id] : x) {
        while (r <= n && Frac{a[r].y, 1} < Frac{-c, b}) {
            int c = a[r].col;
            nans -= 1ll * col[c] * col[c], ++col[a[r++].col];
            nans += 1ll * col[c] * col[c];
        }
        finalans[id] = nans;
    }
    memset(col, 0, sizeof(col)), nans = 0, clear(x);
    for (auto _ : q)
        if (_.b < 0) x.emplace_back(_);
    sort(x.begin(), x.end(), [&](Querya x, Querya y) {
        return Frac{-x.c, x.b} > Frac{-y.c, y.b};
    });
    sort(a + 1, a + n + 1, [&](Point x, Point y) { return x.y > y.y; }), r = 1;
    for (auto [aa, b, c, id] : x) {
        while (r <= n && Frac{a[r].y, 1} > Frac{-c, b}) {
            int c = a[r].col;
            nans -= 1ll * col[c] * col[c], ++col[a[r++].col];
            nans += 1ll * col[c] * col[c];
        }
        finalans[id] = nans;
    }
}
};  // namespace SHU_SCANLINE
namespace MOQUE {
template <const int S, const int L, typename T>
struct darry {
    pair<int, T> a[S];
    T chi[S];
    T *top[L], *nt;
    int sz[L], len;
    struct vector_helper {
        darry &arr;
        int posx;
        inline T *begin() { return arr.top[posx]; }
        inline T *end() { return arr.top[posx] + arr.sz[posx]; }
        inline void push(T x) { arr.a[++arr.len] = {posx, x}; }
    };
    inline void clear() { len = 0; }
    inline void build() {
        nt = chi, memset(sz, 0, sizeof(sz));
        for (int i = 1; i <= len; i++) ++sz[a[i].first];
        for (int i = 0; i < L; i++) top[i] = nt, nt += sz[i], sz[i] = 0;
        for (int i = 1; i <= len; i++)
            top[a[i].first][sz[a[i].first]++] = a[i].second;
    }
    inline vector_helper operator[](int x) { return {*this, x}; }
};
// vector<pair<int, int> >
darry<33000000, 500005, int> vec;
struct Queryb {
    double k;
    ll A, B, S, T;
    int id;
    inline bool countain1(Point x) { return -A * x.x + B * x.y + S < 0; }
    inline bool countain2(Point x) { return -A * x.x + B * x.y + T < 0; }
    inline bool countain1_(Point x) { return A * x.x + B * x.y + S < 0; }
    inline bool countain2_(Point x) { return A * x.x + B * x.y + T < 0; }
    inline bool operator<(Queryb y) const { return k < y.k; }
};
vector<Queryb> f, f2;
vector<Querya> q;
vector<pair<Frac, Querya> > task[N], task2[N];
mt19937 rng(random_device{}());
pair<int, Point> b1[N], b2[N], b3[N], b4[N];
inline bool cmp1(Point x, Point y) {
    return x.x != y.x ? x.x < y.x : x.y < y.y;
}
inline bool cmp2(Point x, Point y) {
    return x.x != y.x ? x.x > y.x : x.y > y.y;
}
const int S = 1005;
struct Update {
    int x, y;
    double k;
    inline bool operator<(Update b) const { return k < b.k; }
} c[S * S], c2[S * S];
int pos1[N], pos2[N], pos3[N], pos4[N], id[N];
vector<int> vec2[N];
inline void update1(pair<int, Point> *b, int *pos, int u, int v) {
    if (pos[u] > pos[v]) return;
    while (pos[u] < pos[v]) {
        int nv = b[pos[u] + 1].first;
        swap(b[pos[u]], b[pos[nv]]), swap(pos[u], pos[nv]);
        u = nv;
    }
}
inline int upper(pair<int, Point> *b, Querya x, int sz) {
    if (x.countain(b[sz].second)) return sz + 1;
    int ans = sz + 1;
    int L = 1, R = sz, mid;
    while (L <= R) {
        mid = L + R >> 1;
        if (x.countain(b[mid].second))
            L = mid + 1;
        else
            ans = mid, R = mid - 1;
    }
    return ans;
}
inline void solve(int x) {
    double pre = clock();
    for (int i = 1; i <= x; i++)
        b1[i].second.x = -b1[i].second.x, b2[i] = b1[i];
    int len = 0;
    sort(b1 + 1, b1 + x + 1, [&](pair<int, Point> a, pair<int, Point> b) {
        return cmp1(a.second, b.second);
    });
    sort(b2 + 1, b2 + x + 1, [&](pair<int, Point> a, pair<int, Point> b) {
        return cmp2(a.second, b.second);
    });
    for (int i = 1; i <= x; i++)
        for (int j = i + 1; j <= x; j++)
            if (b1[i].second.x != b1[j].second.x) {
                double t = double(b1[i].second.y - b1[j].second.y) /
                           (b1[i].second.x - b1[j].second.x);
                if (t < f.back().k) c[++len] = {i, j, t};
            }
    sort(c + 1, c + len + 1);
    T_sum += clock() - pre;
    for (int i = 1; i <= x; i++)
        pos2[i] = pos1[i] = i, b2[i].first = b1[i].first = i;
    int r = 1, r2 = 1;
    double pre2 = clock();
    for (auto s : f) {
        auto [k, A, B, S, T, id] = s;
        while (r <= len && c[r].k < k) {
            update1(b1, pos1, c[r].x, c[r].y),
                update1(b2, pos2, x - c[r].y + 1, x - c[r].x + 1), ++r;
        }
        if (B > 0) {
            int aa = upper(b1, {A, B, S}, x), bb = upper(b1, {A, B, T}, x);
            if (aa > bb) swap(aa, bb);
            for (int i = aa; i < bb; i++)
                if (s.countain1(b1[i].second) && !s.countain2(b1[i].second))
                    vec[id].push(b1[i].second.col);
                else if (!s.countain1(b1[i].second) &&
                         s.countain2(b1[i].second))
                    vec[id].push(-b1[i].second.col);
        } else {
            int aa = upper(b2, {A, B, S}, x), bb = upper(b2, {A, B, T}, x);
            if (aa > bb) swap(aa, bb);
            for (int i = aa; i < bb; i++)
                if (s.countain1(b2[i].second) && !s.countain2(b2[i].second))
                    vec[id].push(b2[i].second.col);
                else if (!s.countain1(b2[i].second) &&
                         s.countain2(b2[i].second))
                    vec[id].push(-b2[i].second.col);
        }
    }
    T_sum2 += clock() - pre;
}
inline void count(bool flag) {
    int s = max(1, int(sqrt(f.size() * 0.6)));
    if (flag)
        for (auto &[k, A, B, S, T, id] : f) A = -A;
    for (int i = 1; i <= n; i += s) {
        for (int j = i; j < min(n + 1, i + s); j++) b1[j - i + 1].second = a[j];
        if (flag) {
            for (int j = i; j < min(n + 1, i + s); j++)
                b1[j - i + 1].second.x = -b1[j - i + 1].second.x;
        }
        solve(min(n - i + 1, s));
    }
}
inline void add(int x) {
    nans -= col[x] * col[x], ++col[x], nans += col[x] * col[x];
}
inline void del(int x) {
    nans -= col[x] * col[x], --col[x], nans += col[x] * col[x];
}
Point p[N];
vector<Point> fa, fb;
vector<int> veca[N], vecb[N];
inline int upper2(Point x, int u) {
    if (!task[u].size()) return 0;
    if (!(Frac(x.x, x.y) < task[u].back().first)) return task[u].size();
    int L = 0, R = task[u].size() - 1, M, ans = task[u].size();
    while (L <= R) {
        M = L + R >> 1;
        if (Frac(x.x, x.y) < task[u][M].first)
            ans = M, R = M - 1;
        else
            L = M + 1;
    }
    return ans;
}
inline int lower2(Point x, int u) {
    if (!task[u].size()) return 0;
    if (!(Frac(x.x, x.y) <= task[u].back().first)) return task[u].size();
    int L = 0, R = task[u].size() - 1, M, ans = task[u].size();
    while (L <= R) {
        M = L + R >> 1;
        if (Frac(x.x, x.y) <= task[u][M].first)
            ans = M, R = M - 1;
        else
            L = M + 1;
    }
    return ans;
}
Point b[N];
namespace Rotate_Scanline {
inline void rotate_scanline(int u, bool fl) {
    if (!task[u].size()) return;
    memset(col, 0, sizeof(col)), nans = 0;
    for (int i = 0; i <= task[u].size(); i++) clear(veca[i]), clear(vecb[i]);
    sort(task[u].begin(), task[u].end());
    for (int i = 1; i <= n; i++) {
        b[i] = {a[i].x - p[u].x, a[i].y - p[u].y, a[i].col};
        if (fl) b[i].x = -b[i].x;
        if (b[i].y == 0) {
            if (b[i].x < 0) add(b[i].col);
        } else if (b[i].y < 0)
            veca[lower2(b[i], u)].push_back(b[i].col), add(b[i].col);
        else
            vecb[upper2(b[i], u)].push_back(b[i].col);
    }
    for (int i = 0; i < task[u].size(); i++) {
        auto [k, s] = task[u][i];
        for (int v : vecb[i]) add(v);
        for (int v : veca[i]) del(v);
        for (int v : vec[s.id]) (v < 0 ? del : add)(abs(v));
        ::finalans[s.id] = nans;
        for (int v : vec[s.id]) (v < 0 ? add : del)(abs(v));
    }
}
};  // namespace Rotate_Scanline
using namespace Rotate_Scanline;
inline int getrand() { return rng() % 3 + -1; }
inline void solve() {
    if (!q.size()) return;
    int s = max(1, int(sqrt(q.size() * 0.65)));
    shuffle(a + 1, a + n + 1, rng);
    clear(f), vec.clear();
    for (int i = 1; i <= s; i++) clear(task[i]);
    for (int i = 1; i <= s; i++)
        p[i] = {a[i].x + getrand(), a[i].y + getrand()};
    for (auto v : q) {
        ll nans = LLONG_MAX, nansid = 0;
        for (int j = 1; j <= s; j++) {
            ll pos = (1ll * p[j].x * v.a + 1ll * p[j].y * v.b + v.c);
            if (abs(pos) < abs(nans)) nans = pos, nansid = j;
        }
        Queryb x = {abs(double(v.a) / (v.b)), v.a, v.b, v.c, v.c - nans, v.id};
        if (v.a > 0)
            task[nansid].emplace_back(Frac{-v.b, abs(v.a)}, v);
        else
            task2[nansid].emplace_back(Frac{-v.b, abs(v.a)}, v);

#ifdef DEBUG__
        for (int i = 1; i <= n; i++)
            if (x.countain1_(a[i]) && !x.countain2_(a[i]))
                vec2[v.id].push_back(a[i].col);
            else if (x.countain2_(a[i]) && !x.countain1_(a[i]))
                vec2[v.id].push_back(-a[i].col);
#endif
        if (v.a * v.b > 0)
            f.push_back(x);
        else
            f2.push_back(x);
    }
    sort(f.begin(), f.end());
    sort(f2.begin(), f2.end());
    count(0), f = f2, count(1);
    vec.build();
    for (int i = 1; i <= s; i++)
        rotate_scanline(i, 0), task[i] = task2[i], rotate_scanline(i, 1);
#ifdef DEBUG__
    cout << "m:" << m << endl;
    for (int i = 1; i <= m; i++) {
        cout << "-" << endl;
        for (int v : vec[i]) cout << v << ' ';
        cout << endl;
        for (int v : vec2[i]) cout << v << ' ';
        cout << endl << endl;
    }
#endif
}
};  // namespace MOQUE
namespace PREV {
vector<Querya> q;
inline void solve() {
    MOQUE::q = q, MOQUE::solve();
    clear(MOQUE::q);
}
};  // namespace PREV
namespace READ {
Querya q[M];
inline void init() {
    read(n, m);
    for (int i = 1; i <= n; i++) read(a[i].x, a[i].y, a[i].col);
    for (int i = 1; i <= m; i++) {
        read(q[i].a, q[i].b, q[i].c), q[i].id = i;
        if (!q[i].a)
            SHU_SCANLINE::q.push_back(q[i]);
        else if (!q[i].b)
            WATER_SCANLINE::q.push_back(q[i]);
        else
            PREV::q.push_back(q[i]);
    }
}
};  // namespace READ
int main() {
    READ::init();
    SHU_SCANLINE::solve(), WATER_SCANLINE::solve();
    // MOQUE::solve();
    PREV::solve();
    for (int i = 1; i <= m; i++) println(finalans[i]);
    cerr << double(clock()) / CLOCKS_PER_SEC << ' ' << T_sum / CLOCKS_PER_SEC
         << ' ' << T_sum2 / CLOCKS_PER_SEC << endl;
}