/**
 * CS1101 Lab 05 Ex 2: Gecko.java
 *
 * <fill in your discussion group here>
 *
 * This class solves the Gecko problem.
 **/

import java.util.*;

public class Gecko
{
    public static void main(String[] args)
    {
        Scanner stdIn = new Scanner(System.in);
        int w = stdIn.nextInt();
        int h = stdIn.nextInt();

        // Create a slightly larger width, so that the wall is flanked 
        // by two empty columns. This simplifies our solve method.
        int[][] wall = new int[h][w+2];
        for (int i = h-1; i >= 0; i--)
        {
            for (int j = 0; j < w; j++)
            {
                wall[i][j+1] = stdIn.nextInt();
            }
        }
        int mosquitos = 0;

        /*
         *  Write your code to solve the problem here.
         */

        System.out.println(mosquitos);
    }
}


