#include using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; template using minheap = priority_queue, greater>; template using maxheap = priority_queue; template bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template int flg(T x, int i) { return (x >> i) & 1; } int pct(int x) { return __builtin_popcount(x); } int pct(ll x) { return __builtin_popcountll(x); } int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template void print(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template void printn(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template int lb(const vector &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template int ub(const vector &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template void rearrange(vector &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template vector id_sort(const vector &v, bool greater = false) { int n = v.size(); vector ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template void reorder(vector &a, const vector &ord) { int n = a.size(); vector b(n); for (int i = 0; i < n; i++) b[i] = a[ord[i]]; swap(a, b); } template T floor(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? x / y : (x - y + 1) / y); } template T ceil(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? (x + y - 1) / y : x / y); } template pair operator+(const pair &p, const pair &q) { return make_pair(p.first + q.first, p.second + q.second); } template pair operator-(const pair &p, const pair &q) { return make_pair(p.first - q.first, p.second - q.second); } template istream &operator>>(istream &is, pair &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template ostream &operator<<(ostream &os, const pair &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); cerr << fixed << setprecision(15); } } io_setup; constexpr int inf = (1 << 30) - 1; constexpr ll INF = (1LL << 60) - 1; // constexpr int MOD = 1000000007; constexpr int MOD = 998244353; template struct Fast_Fourier_Transform { using comp = complex; static double pi; static vector r, ir; Fast_Fourier_Transform() {} static void init() { if (!r.empty()) return; r.resize(30), ir.resize(30); for (int i = 0; i < 30; i++) { r[i] = -polar(1.0, pi / (1 << (i + 1))); // r[i] := 1 の 2^(i+2) 乗根 ir[i] = -polar(1.0, -pi / (1 << (i + 1))); // ir[i] := 1/r[i] } } static vector to_comp(vector a) { vector ret(a.size()); for (int i = 0; i < (int)a.size(); i++) ret[i] = comp(a[i], 0.0); return ret; } static vector to_T(vector a) { vector ret(a.size(), 0); for (int i = 0; i < (int)a.size(); i++) ret[i] = a[i].real() + 0.1; // 整数の場合、誤差をケア // for(int i = 0; i < (int)a.size(); i++) ret[i] = a[i].real(); // 小数の場合 return ret; } static void fft(vector &a) { init(); int n = a.size(); assert((n & (n - 1)) == 0); for (int k = n; k >>= 1;) { comp w = 1; for (int s = 0, t = 0; s < n; s += 2 * k) { for (int i = s, j = s + k; i < s + k; i++, j++) { comp x = a[i], y = w * a[j]; a[i] = x + y, a[j] = x - y; } w *= r[__builtin_ctz(++t)]; } } } static void ifft(vector &a) { init(); int n = a.size(); assert((n & (n - 1)) == 0); a.resize(n); for (int k = 1; k < n; k <<= 1) { comp w = 1; for (int s = 0, t = 0; s < n; s += 2 * k) { for (int i = s, j = s + k; i < s + k; i++, j++) { comp x = a[i], y = a[j]; a[i] = x + y, a[j] = w * (x - y); } w *= ir[__builtin_ctz(++t)]; } } for (auto &e : a) e /= n; } static vector convolve(vector a, vector b) { int k = (int)a.size() + (int)b.size() - 1, n = 1; while (n < k) n <<= 1; vector A = to_comp(a), B = to_comp(b); A.resize(n), B.resize(n); fft(A), fft(B); for (int i = 0; i < n; i++) A[i] *= B[i]; ifft(A); vector c = to_T(A); c.resize(k); return c; } }; template double Fast_Fourier_Transform::pi = acos(-1.0); template vector> Fast_Fourier_Transform::r = vector>(); template vector> Fast_Fourier_Transform::ir = vector>(); using FFT = Fast_Fourier_Transform; void solve() { int N, M; cin >> N >> M; int D = 201; auto get_1 = [&](int a, int b, int c) { return D * D * c + D * b + a; // }; auto get_2 = [&](int a, int b, int c) { return get_1(100 - a, 100 - b, 100 - c); // }; int MAX = D * D * 100 + D * 100 + 100; vector f(MAX + 1, 0), g(MAX + 1, 0); rep(i, N) { int a, b, c; cin >> a >> b >> c; f[get_1(a, b, c)]++; g[get_2(a, b, c)]++; } auto h = FFT::convolve(f, g); ll ans = 0; rep(i, M) { int a, b, c; cin >> a >> b >> c; chmax(ans, N + N - h[get_1(100 + a, 100 + b, 100 + c)]); } cout << ans << '\n'; } int main() { int T = 1; // cin >> T; while (T--) solve(); }