// what is matter? never mind.
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m,res;
int a[2005][2005],deg[maxn];
char str[maxn];

signed main()
{
//	freopen("a9.in","r",stdin);
//	freopen("a9.out","w",stdout);
	n=read(),m=read();
	For(i,1,n){
		cin>>str;
		For(j,1,m){
			a[i][j]=(str[j-1]&1);
			if(!a[i][j])deg[i]++,deg[j+n]++;
		}
	}
	int nn=n,mm=m;
	For(i,1,n) if(!deg[i]) --nn;
	For(i,n+1,n+m) if(!deg[i]) --mm;
	int res=nn+mm+1;
	For(i,1,n)
		if(deg[i]==1){
			int v=0;
			For(j,1,m) if(!a[i][j]) v=j;
			if(deg[v+n]==1) --res;
		}
	cout<<res;
	return 0;
}
/*

*/