Codeforces Round #330 (Div. 2) A. Vitaly and Night（模拟）

#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define X first
#define Y second
#define cl(a,b) memset(a,b,sizeof(a))
typedef pair<int,int> P;
const int maxn=30005;
const int inf=1<<27;

int main(){
int n,m;
scanf("%d%d",&n,&m);
int ans=0;
for(int i=0;i<n;i++){
for(int j=0;j<m*2;j+=2){
int x,y;
cin>>x>>y;
if(x||y)ans++;
}
}
cout<<ans<<endl;
return 0;
}