Example

Input

2 2 2 1
0 0 0


Output

24
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a*b/gcd(a,b);
}

signed main(void) {
    int a,b,c,n;
    cin >> a >> b >> c >> n;
    vi x(n),y(n),z(n);
    rep(i,n)cin >> x[i] >> y[i] >> z[i];
    int ans = a*b*2 + a*c*2 + b*c*2;
    rep(i,n){
        int t = 0;
        if(x[i] == 0)t++;
        if(x[i] == a-1)t++;
        if(y[i] == 0)t++;
        if(y[i] == b-1)t++;
        if(z[i] == 0)t++;
        if(z[i] == c-1)t++;
        rep(j,i){
            int diff = abs(x[i]-x[j]) + abs(y[i]-y[j]) + abs(z[i]-z[j]);
            if(diff == 1)t++;
        }
        ans += -t + (6-t);
    }
    cout << ans << endl;
}

