#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
bool vis[10000] ;
int main(){
   ios_base::sync_with_stdio(0);cin.tie(0);
    int n , m ;
    cin >> n >> m;
    string s ;
    int res = 0 ;
    vector <string> v ;
    for ( int i = 0 ; i < n ; i++ ) {
    	cin >> s;
    	v.pb(s);
    }
    for ( int j = 0 ; j < m ; j++ ) {
    	int a = 0 , b ;
    	for ( int i = 0 ; i < n ; i++ )  {
    		if ( v[i][j] == '1' ) {
    			a++;
    			b=i;
    		}
    	}
    	if ( a == 1 && !vis[b] )  {
    		vis[b] = true;
    		res++;
    	}
    }
    cout << res ;
   return 0;
}