#include<bits/stdc++.h>
using namespace std;

const int N=1e6+1e3+7;

using P=tuple<int,int,int>;

set<P >key;

set<P >blk;

int A,B,C,n;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>A>>B>>C;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int x,y,z;
        cin>>x>>y>>z;
        blk.insert({x,y,z});
    }
    for(auto [x,y,z]:blk)
    {
        for(auto dx:{-1,0,1})
            for(auto dy:{-1,0,1})
                for(auto dz:{-1,0,1})
                {
                    if(x+dx<0||x+dx>=A||y+dy<0||y+dy>=B||z+dz<0||z+dz>=C)
                        continue;
                    key.insert({x+dx,y+dy,z+dz});
                }
    }
    auto nkey=key;
    for(auto [x,y,z]:key)
    {
        for(int S=0;S<8;S++)
        {
            for(int T=0;T<8;T++)
            {
                if(T!=(S&T))
                    continue;
                int nx=x,ny=y,nz=z;
                if(S&1)
                    nx=T&1?0:A-1;
                if(S&2)
                    ny=T&1?0:B-1;
                if(S&4)
                    nz=T&1?0:C-1;
                nkey.insert({nx,ny,nz});
            }
        }
    }
    key.swap(nkey);
    map<P,int> id;
    for(auto p:key) 
        id[p]=id.size();
    vector<int> fa(key.size()),isb(key.size());
    for(auto x:blk)
        isb[id[x]]=1;
    iota(fa.begin(),fa.end(),0);
    auto find=[&](auto self,const int &x)->int  {
        return x==fa[x]?x:fa[x]=self(self,fa[x]);
    };

    {
        map<pair<int,int>,vector<pair<int,int> > >pts;
        for(auto [p,w]:id)
        {
            auto [x,y,z]=p;
            pts[{x,y}].push_back({z,w});
        }
        for(auto [nd,v]:pts)
        {
            sort(v.begin(),v.end());
            for(int i=0;i+1<v.size();i++)
            {
                if(isb[v[i].second]||isb[v[i+1].second])
                    continue;
                fa[find(find,v[i].second)]=find(find,v[i+1].second);
            }
        }
    }
    {
        map<pair<int,int>,vector<pair<int,int> > >pts;
        for(auto [p,w]:id)
        {
            auto [x,y,z]=p;
            pts[{y,z}].push_back({x,w});
        }
        for(auto [nd,v]:pts)
        {
            sort(v.begin(),v.end());
            for(int i=0;i+1<v.size();i++)
            {
                if(isb[v[i].second]||isb[v[i+1].second])
                    continue;
                fa[find(find,v[i].second)]=find(find,v[i+1].second);
            }
        }
    }
    {
        map<pair<int,int>,vector<pair<int,int> > >pts;
        for(auto [p,w]:id)
        {
            auto [x,y,z]=p;
            pts[{x,z}].push_back({y,w});
        }
        for(auto [nd,v]:pts)
        {
            sort(v.begin(),v.end());
            for(int i=0;i+1<v.size();i++)
            {
                if(isb[v[i].second]||isb[v[i+1].second])
                    continue;
                fa[find(find,v[i].second)]=find(find,v[i+1].second);
            }
        }
    }
    int ans=0;
    for(int i=0;i<key.size();i++)
        if(fa[i]==i&&!isb[i])
            ans++;
    cout<<ans<<"\n";
}