import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int h = sc.nextInt();
        int w = sc.nextInt();
        boolean[][] field = new boolean[h + 2][w + 2];
        for (int i = 1; i <= h; i++) {
            for (int j = 1; j <= w; j++) {
                field[i][j] = (sc.nextInt() == 1);
            }
        }
        ArrayDeque<Integer> deq = new ArrayDeque<>();
        int count = 0;
        for (int i = 1; i <= h; i++) {
            for (int j = 1; j <= w; j++) {
                if (field[i][j]) {
                    count++;
                    deq.add(i * (w + 2) + j);
                    while (deq.size() > 0) {
                        int x = deq.poll();
                        int xh = x / (w + 2);
                        int xw = x % (w + 2);
                        if (!field[xh][xw]) {
                            continue;
                        }
                        field[xh][xw] = false;
                        if (field[xh][xw + 1]) {
                            deq.add(xh * (w + 2) + xw + 1);
                        }
                        if (field[xh][xw - 1]) {
                            deq.add(xh * (w + 2) + xw - 1);
                        }
                        if (field[xh + 1][xw]) {
                            deq.add((xh + 1) * (w + 2) + xw);
                        }
                        if (field[xh - 1][xw]) {
                            deq.add((xh - 1) * (w + 2) + xw);
                        }
                    }
                }
            }
        }
        System.out.println(count);
    }
}