
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define nl '\n'
#define fn ""
#define F first
#define S second 
#define rs resize
#define kt size
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
int n,m;
vector<vector<int>> a;
bool check (int i,int j) {
    int cnt=0;
    for (int k=0;k<4;k++) {
        int x=i+dx[k];
        int y=j+dy[k];
        if (x<1 || y<1 || x>n || y>m) continue;
        if (a[x][y]==0) cnt++;
    }
    return cnt>=2;
}
bool checkfull() {
    for (int i=1;i<=n;i++) {
        for (int j=1;j<=m;j++) {
            if (a[i][j]==1) return true;
        }
    }
    return false;
}
int main () {
    ios_base::sync_with_stdio(false);
    cin.tie (nullptr);
    if (FILE *f=fopen(fn".INP","r")) {
        fclose(f);
        freopen (fn".INP","r",stdin);
        freopen (fn".OUT","w",stdout);
    }
    cin >> n >> m;
    a.resize(n+1,vector <int> (m+1));
    for (int i=1;i<=n;i++) {
        for (int j=1;j<=m;j++) cin >> a[i][j];
    }
    int ans=0;
    while (checkfull()) {
        vector<pair<int,int>> v;
        for (int i=1;i<=n;i++) {
            for (int j=1;j<=m;j++) {
                if (check(i,j)) v.push_back({i,j});
            }
        }
        if (v.empty()) break;
        for (auto p:v) a[p.F][p.S]=0;
        ans++;
    }
    cout << ans;
    return 0;
}
