F всесиб

/*
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃＼○／
┛┗┛┗┛┃ / /
┓┏┓┏┓┃ノ
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃┓
┛┗┛┗┛┃┃
      MIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSIC
*/

// #define pragma

#ifdef pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Wunused-result"
#endif // pragma

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define pb push_back
#define x first
#define y second
#define int long long
#define zero(two) memset(two, 0, sizeof(two))

using namespace std;
using namespace __gnu_pbds;


typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef long double ld;
typedef vector<vi> matrix;
template<typename T>
using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(10);
    #if _offline
        freopen("input", "r", stdin);
        freopen("output", "w", stdout);
    #endif
}

const int INF = 1e9 + 7;
const int MAXN = 101;

vector<vi> t(MAXN);

void update(int v, int tl, int tr, int ver, int pos, int val) {
    if(tl > pos || tr < pos) {
        return;
    }
    if(tl == tr) {
        t[ver][v] = val;
        return;
    }
    int tm = (tl + tr) >> 1;
    update(v * 2 + 1, tl, tm, ver, pos, val);
    update(v * 2 + 2, tm + 1, tr, ver, pos, val);
    t[ver][v] = min(t[ver][v * 2 + 1], t[ver][v * 2 + 2]);
}

int get(int v, int tl, int tr, int ver, int l, int r) {
    if(tl > r || tr < l) {
        return INF;
    }
    if(tl >= l && tr <= r) {
        return t[ver][v];
    }
    int tm = (tl + tr) >> 1;
    int left = get(v * 2 + 1, tl, tm, ver, l, r);
    int right = get(v * 2 + 2, tm + 1, tr, ver, l, r);
    return min(left, right);
}

signed main() {
    seriy();
    int a, b, c;
    cin >> a >> b >> c;
    if(a > 40 || b > 40 || c > 40) {
        assert(0);
    }
    bool m[a][b][c];
    int d[b][c];
    for(int j = 0; j < b; j++) {
        for(int k = 0; k < c; k++) {
            d[j][k] = -1;
        }
    }
    for(int i = 0; i < a; i++) {
        for(int j = 0; j < b; j++) {
            for(int k = 0; k < c; k++) {
                char ch;
                cin >> ch;
                m[i][j][k] = (ch == '1');
            }
        }
    }
    int ans = 0;
    for(int i = 0; i < a; i++) {
        for(int j = 0; j < b; j++) {
            if(i == 0) {
                t[j].resize(4 * MAXN);
            }
            else {
                t[j].assign(4 * MAXN, 0);
            }
            for(int k = 0; k < c; k++) {
                if(m[i][j][k]) {
                    d[j][k] = i;
                }
                update(0, 0, MAXN - 1, j, k, i - d[j][k]);
            }
        }
        for(int j = 0; j < b; j++) {
            for(int k = j; k < b; k++) {
                vi tmp(c);
                for(int h = 0; h < c; h++) {
                    tmp[h] = get(0, 0, MAXN - 1, h, j, k);
                }

            }
        }
    }
    cout << ans;
    return 0;
}