Example

Input

2 2 2 1
0 0 0


Output

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

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

#define MT make_tuple

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  LL A, B, C, N;
  cin >> A >> B >> C >> N;

  LL ans = 2 * (A*B + B*C + C*A);
  set<tuple<LL,LL,LL>> del;

  REP(i,N){
	LL x, y, z;
	cin >> x >> y >> z;
	if(del.count(MT(x,y,z))) continue;

	int cnt = 0;
	if(x-1 < 0 || del.count(MT(x-1,y,z)))
	  ++cnt;
	if(A <= x+1 || del.count(MT(x+1,y,z)))
	  ++cnt;
	if(cnt == 0) ans += 2;
	else if(cnt == 2) ans -= 2;

  	cnt = 0;
	if(y-1 < 0 || del.count(MT(x,y-1,z)))
	  ++cnt;
	if(B <= y+1 || del.count(MT(x,y+1,z)))
	  ++cnt;
	if(cnt == 0) ans += 2;
	else if(cnt == 2) ans -= 2;

  	cnt = 0;
	if(z-1 < 0 || del.count(MT(x,y,z-1)))
	  ++cnt;
	if(C <= z+1 || del.count(MT(x,y,z+1)))
	  ++cnt;
	if(cnt == 0) ans += 2;
	else if(cnt == 2) ans -= 2;

	del.insert(MT(x,y,z));
  }

  cout << ans << endl;

  return 0;
}