#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef bitset<1030301> B;

int main(){
	int n, m; cin >> n >> m;
	vector<int> a(n), b(n), c(n);
	vector<int> x(m), y(m), z(m);
	for (int i=0; i<n; i++){
		cin >> a[i] >> b[i] >> c[i];
	}
	for (int i=0; i<m; i++){
		cin >> x[i] >> y[i] >> z[i];
	}
	B moto;
	for (int i=0; i<n; i++){
		moto[a[i] + b[i] * 101 + c[i] * 101 * 101] = 1;
	}
	int ans = 0;
	for (int i=0; i<m; i++){
		ans = max(ans, 2 * n - (int)(moto & (moto >> abs(x[i] + y[i] * 101 + z[i] * 101 * 101))).count());
	}
	cout << ans << '\n';
}