#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
long long n,m,i,j,a,max1,max2,min1,min2;
int main()
{
    freopen("mines.in","r",stdin);
    freopen("mines.out","w",stdout);
    scanf("%lld%lld",&n,&m);
    min1=n;
    min2=m;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
        {
            scanf("%lld",&a);
            if(a==1)
            {
                if(i<min1) {min1=i;}
                if(j<min2) {min2=j;}
                if(i>max1) max1=i;
                if(j>max2) max2=j;
            }
        }
    }
    max1=n-max1+1;
    max2=m-max2+1;
    printf("%lld\n",(min1)*(min2)*(max1)*(max2));
	return 0;
}