#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(),vec.end()
#define umap __gnu_pbds::gp_hash_table
#define vi vector<int>
#define eb emplace_back
using ll = long long;
using db = double;
using i128 = __int128;
#define Emu Smile
using namespace std;

void chmax(auto &a, auto b) { if (a < b) a = b; }
void chmin(auto &a, auto b) { if (a > b) a = b; }
inline int lbt(int x) { return x & (-x); }

const ll inf = 1e16;

void solve() {
	int n,m; cin >> n >> m;
	vector<string> s(n);
	for (int i = 0; i < n; ++i) {
		cin >> s[i];
	}
	vector<int> c(m);
	auto build = [&](const vector<int> &nd) {
		const int n = sz(nd);
		//	std::sort(all(nd)); 	若k值递增则不需要排序
		std::vector<std::pair<int,int>> ret(n, std::pair(-1, -1));
		std::vector<int> stack;
		for (int i = 0; i < n; ++i) {
			int lst = -1;
			while (!stack.empty()) {
				if (nd[stack.back()] > nd[i]) {
					lst = stack.back();
					stack.pop_back();
				} else {
					ret[stack.back()].second = i;
					break;
				}
			}
			ret[i].first = lst;
			stack.emplace_back(i);
		}
		return pair(stack[0] , ret);
	};
	auto get = [&](auto &&self,int l,int r,int x) -> int {
		if (l > r) {
			swap(l,r);
		}
		if (l+x <= r) {
			return self(self,l,r-x,x*2)+1;
		}
		else {
			if (!l) {
				if (!r) {
					return 0;
				}
				return 1;
			}
			int k = max(l-x,0);
			return self(self,k,r,x+l-k)+1;
		}
	};
	ll ret = inf;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			if (s[i][j] == '1') {
				c[j] ++;
			} else {
				c[j] = 0;
			}
		}
		auto [rt, eg] = build(c);
		auto dfs = [&](auto &self,int l,int r,int u) -> void {
			if (c[u] && (r - l)) {
				ll t = get(get,i+1-c[u],n-1-i,c[u]) + get(get,l,m-r,r-l);
				chmin(ret, t);
			}
			auto [x,y] = eg[u];
			if (x != -1) {
				self(self,l,u,x);
			}
			if (y != -1) {
				self(self,u+1,r,y);
			}
		};
		dfs(dfs,0,m,rt);
	}
	cout << ret << '\n';
}

int main() {

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);

//	init();

	cout << fixed << setprecision(10);

	int OuO = 1;
//	cin >> OuO;
	for (int piastic = 0; piastic < OuO; ++piastic) {
		solve();
	}
	return 0;
}