#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;
int w, x, h, q, x1, y1, z1, x2, y2, z2;
int ans = 0;
bool s[25][25][25];
int main()
{
    cin >> w >> x >> h >> q;
    int V = w * x * h;

    memset(square, 0, sizeof(square));
    while (q --)
        cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2;
    for (int i = min(x1, x2); i <= max(x1, x2); i ++)
        for (int j = min(y1, y2); j <= max(y1, y2); j ++)
            for (int k = min(z1, z2); k <= max(z1, z2); k ++)
                s[i][j][k] = 1;
    for (int i = 1; i <= w; i ++)
        for (int j = 1; j <= x; j ++)
            for (int k = 1; k <= h; k ++)
                if (!square[i][j][k])
                    ans ++;
    cout << ans;        
    return 0;
}