var
a,b,c,d,i,j,m,n,o:longint;
k,l:array[0..1200,0..1200]of longint;
lx,ly:array[1..8]of integer;
procedure dfs(y,x:longint);
var
e,r,t,z:longint;
begin
for z:=1 to 8 do
if (x+lx[z]<b+1)and(x+lx[z]>0)and(y+ly[z]>0)and(y+ly[z]<a+1) then
if k[y+ly[z],x+lx[z]]<>0 then
if l[y+ly[z],x+lx[z]]=0 then
begin
l[y+ly[z],x+lx[z]]:=m;
dfs(y+ly[z],x+lx[z]);
end;
end;

begin
assign(input,'badgras.in');
assign(output,'badgras.out');
reset(input);
rewrite(output);
lx[1]:=1;
lx[2]:=-1;
lx[3]:=0;
lx[4]:=0;
lx[5]:=1;
lx[6]:=-1;
lx[7]:=1;
lx[8]:=-1;
ly[1]:=0;
ly[2]:=0;
ly[3]:=-1;
ly[4]:=1;
ly[5]:=1;
ly[6]:=-1;
ly[7]:=-1;
ly[8]:=1;
read(a,b);
for i:=1 to a do
begin
for j:=1 to b do
read(k[i,j]);
readln;
end;
for i:=1 to a do
for j:=1 to b do
if (k[i,j]<>0)and(l[i,j]=0) then
begin
m:=m+1;
l[i,j]:=m;
dfs(i,j);
end;
write(m);
close(input);
close(output);
end.