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

using namespace std;

int g[80000][200];
int st[80000][200];
int n, m, l, t;
int ans;
int cnt;

void dfs(int x, int y)
{
    st[x][y] = 1;
    cnt ++;

    int z = x / n;
    x = x % n;

    int dx[] = {-1, 0, 1, 0, 0, 0}, dy[] = {0, 1, 0, -1, 0, 0}, dz[] = {0, 0, 0, 0, 1, -1};

    for(int i = 0; i < 6; i ++)
    {
        int xx = x + dx[i], yy = y + dy[i], zz = z + dz[i];

        if(xx >= 0 and xx < n and yy >= 0 and yy < m and zz >= 0 and zz < l)
        {
            xx += n * zz;

            if(!st[xx][yy] and g[xx][yy] == 1)
                dfs(xx, yy);
        }
    }
}

int main()
{
    cin >> n >> m >> l >> t;

    for(int i = 0; i < n * l; i ++)
        for(int j = 0; j < m; j ++)
            cin >> g[i][j];

    for(int i = 0; i < n * l; i ++)
        for(int j = 0; j < m; j ++)
        {
            if(g[i][j] == 1 and !st[i][j])
            {
                cnt = 0;
                dfs(i, j);

                if(cnt>= t)
                ans += cnt;
            }
        }

    cout << ans;
}