#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 453;
int L[N][N], R[N][N], D[N][N][N], J[N], a[N][N], T[N], p;
int Q[N], l, r;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
char c;
cin >> c;
a[i][j] = c - '0';
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++)
L[i][j] = (a[i][j] ? L[i][j - 1] + 1 : 0);
for (int j = m; j >= 1; --j)
R[i][j] = (a[i][j] ? R[i][j + 1] + 1 : 0);
}
int X = 1e9;
for (int j = 1; j <= m; j++) {
for (int i = 1; i <= n; i++) T[i] = (a[i][j] ? T[i - 1] + 1 : 0);
for (int i = 1; i <= n; i++)
if (a[i][j] && !a[i + 1][j]) X = min(X, T[i]);
}
for (int h = 1; h <= X; h++) {
J[h] = 1e9;
for (int j = 1; j <= m; j++) { // fix a column j
for (int i = 1; i <= n; i++)
T[i] = (a[i][j] ? L[i][j] + R[i][j] - 1 : int(1e9));
// sliding window minimum of size h over T
deque<int> dq;
for (int i = 1; i <= n; i++) {
while (!dq.empty() && T[dq.back()] >= T[i]) dq.pop_back();
dq.push_back(i);
if (i >= h) J[h] = min(J[h], T[dq.front()]);
while (!dq.empty() && dq.front() <= i - h) dq.pop_front();
}
}
}
int ans = 0;
for (int h = 1; h <= n; h++) ans = max(ans, h * J[h]);
cout << ans << "\n";
}
