#include<bits/stdc++.h>
using namespace std;
int n,m,r,o,x[10005],y[10005],z[10005],as;
struct N{
    int x,y,z,s;
}p;
queue<N>q;
int main(){
    freopen("problema.in","r",stdin);
    freopen("problema.out","w",stdout);
    cin>>n>>m>>r;
    cin>>o;
    for(int i=1;i<=o;i++) cin>>x[i]>>y[i]>>z[i];
    q.push({0,0,0,0});
    while(!q.empty()){
        p=q.front();
        q.pop();
        if(p.x==n&&p.y==m&&p.z==r){
            as++;
            continue;
        }
        for(int i=p.x+1;i<=n;i++){
            if((i&p.x)==p.x) q.push({i,p.y,p.z,p.s+1});
        }
        for(int i=p.y+1;i<=m;i++){
            if((i&p.y)==p.y) q.push({p.x,i,p.z,p.s+1});
        }
        for(int i=p.z+1;i<=r;i++){
            if((i&p.z)==p.z) q.push({p.x,p.y,i,p.s+1});
        }
    }
    cout<<as;
    return 0;
}