#include <iostream>
using namespace std;
int n,m,r,o;
bool bj[102][102][102];
int ans=0;
void dfs(int x,int y,int z){
    if(x==n&&y==m&&z==r){
        ans++;
        return;
    }
    for(int i=x+1;i<=n;i++){
        if((i&x)==x&&!bj[i][y][z]) dfs(i,y,z);
    }
    for(int i=y+1;i<=m;i++){
        if((i&y)==y&&!bj[x][i][z]) dfs(x,i,z);
    }
    for(int i=z+1;i<=r;i++){
        if((i&z)==z&&!bj[x][y][i]) dfs(x,y,i);
    }
}
int main(){
    freopen("problema.in","r",stdin);
    freopen("problema.out","w",stdout);
    cin>>n>>m>>r>>o;
    for(int i=1;i<=o;i++){
        int x,y,z;
        cin>>x>>y>>z;
        bj[x][y][z]=1;
    }
    dfs(0,0,0);
    cout<<ans;
    return 0;
}