#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;
const int maxn=1020;
inline int read() {
    int x=0; char c=getchar();
    for(; c<'0'||c>'9'; c=getchar());
    for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
    return x;
}
char mp[maxn][maxn];
int h[maxn], l[maxn];

int main() {
    int n=read(), m=read();
    for(int i=1; i<=n; ++i) {
        scanf("%s", mp[i]+1);
        for(int j=1; j<=m; ++j) h[i]+=mp[i][j]=='1', l[j]+=mp[i][j]=='1';
    }
    int ans=1;
    for(int i=1; i<=n; ++i) if(h[i]<m) {
        ++ans;
        if(h[i]==m-1) {
            for(int j=1; j<=m; ++j)
                if(mp[i][j]=='0') {
                    if(l[j]==n-1) --ans;
                    break;
                }
        }
    }
    for(int i=1; i<=m; ++i) if(l[i]<n) ++ans;
    printf("%d", ans);
    return 0;
}