#include <bits/stdc++.h>
#define P pair <int, int>
using namespace std;
const int N = 2000005;
int A, B, C, n, f[N], isb[N];
struct S{ int x, y, z;};
bool operator <(S x, S y){ return x.x != y.x? x.x < y.x: x.y != y.y? x.y < y.y: x.z < y.z;}
bool operator ==(S x, S y){ return x.x == y.x && x.y == y.y && x.z == y.z;}
vector <S> blk, pt;
int find(int x){ return f[x] == x? x: f[x] = find(f[x]);}
void slv(int x){
	map <P, vector <P> > mp;
	for(int j = 0; j < pt.size(); j++){
		S i = pt[j];
		mp[x == 0? (P){i.y, i.z}: x == 1? (P){i.x, i.z}: (P){i.x, i.y}].push_back({x == 0? i.x: x == 1? i.y: i.z, j});
	}
	for(auto i: mp){
		auto v = i.second;
		sort(v.begin(), v.end());
		for(int j = 1; j < v.size(); j++){
			int d1 = v[j - 1].second, d2 = v[j].second;
			if(isb[d1] || isb[d2]) continue;
			f[find(d1)] = find(d2);
		}
	}
}
int main(){
	cin >> A >> B >> C >> n;
	for(int i = 1, x, z, y; i <= n; i++){
		cin >> x >> y >> z;
		blk.push_back({x, y, z});
		for(int dx: {x - 1, x, x + 1}) for(int dy: {y - 1, y, y + 1}) for(int dz: {z - 1, z, z + 1}){
			if(dx < 0 || dy < 0 || dz < 0 || dx >= A || dy >= B || dz >= C) continue;
			pt.push_back({dx, dy, dz});
		}
		for(int dx: {0, x, A - 1}) for(int dy: {0, y, B - 1}) for(int dz: {0, z, C - 1}) pt.push_back({dx, dy, dz});
	}
	for(int dx: {0, A - 1}) for(int dy: {0, B - 1}) for(int dz: {0, C - 1}) pt.push_back({dx, dy, dz});
	sort(pt.begin(), pt.end()), pt.resize(unique(pt.begin(), pt.end()) - pt.begin());
	for(S i: blk) isb[lower_bound(pt.begin(), pt.end(), i) - pt.begin()] = 1;
	n = pt.size(); iota(f, f + n, 0);
	slv(0), slv(1), slv(2); int ans = 0;
	for(int i = 0; i < n; i++) ans += f[i] == i && !isb[i];
	cout << ans;
	return 0;
}