#include <iostream>
using namespace std;
int totalRow, totalColumn;


void dfs(int input[50][50], bool visitedIsland[50][50],int row, int col)
{
    //cout << row << " " << col << endl ;
    visitedIsland[row][col] = true;
    if (row < totalRow   && col < totalColumn )
    {
        //Up
        if (row > 0 && input[row - 1][col] == 1 && visitedIsland[row - 1][col] == false)
            dfs(input,visitedIsland,row - 1,col);
        //cout << "up " << row << " " << col << input[row - 1][col] << " " << visitedIsland[row - 1][col] << endl;
        //Down
        if ((row + 1 <= totalRow - 1) && input[row + 1][col] == 1 && visitedIsland[row + 1][col]== false)
            dfs(input,visitedIsland,row + 1,col);
        //cout << "down " << input[1][col] << " " <<visitedIsland[row + 1][col] << endl;
        //Left
        if (col > 0 && input[row][col-1] == 1 && visitedIsland[row][col-1]== false)
            dfs(input,visitedIsland,row,col - 1);
        //cout << "left" << endl;
        //Right
        if ((col + 1 <= totalColumn - 1)&&input[row][col + 1] == 1 && visitedIsland[row][col+1]== false)
            dfs(input,visitedIsland,row,col + 1);
        //Left bottom diagonal
        if (row > 0 && col > 0 && input[row - 1][col - 1] == 1 && visitedIsland[row - 1][col - 1]== false)
            dfs(input,visitedIsland,row - 1,col - 1);
        //cout << "Left bottom " << row << " " << col << input[row - 1][col-1] << " " << visitedIsland[row - 1][col-1] << endl;
        //Left top diagonal
        if ((row + 1 <= totalRow - 1) && col > 0 && input[row + 1][col - 1] == 1 && visitedIsland[row + 1][col - 1]== false)
            dfs(input,visitedIsland,row + 1,col - 1);
        //Right top diagonal
        if ((col + 1 <= totalColumn - 1)&&row > 0 && input[row - 1][col + 1] == 1 && visitedIsland[row - 1][col + 1]== false)
            dfs(input,visitedIsland,row - 1,col +1);
        //cout << "Right top " << row << " " << col << input[row - 1][col+1] << " " << visitedIsland[row - 1][col+1] << endl;
        //Right bottom diagonal
        if ((row + 1 <= totalRow - 1)&&(col + 1 <= totalColumn - 1)&& input[row + 1][col + 1] == 1 && visitedIsland[row + 1][col + 1]== false)
            dfs(input,visitedIsland,row + 1,col +1);
    }
    
}

int main(int argc, const char * argv[]) {
    int row, col;
    while (cin >> col >> row)
    {
        totalRow = row;
        totalColumn = col;
        int numofIsland = 0;
        int input[50][50] = {0};
        bool visitedIsland[50][50] = {false};
        for (int i= 0; i < row; i++)
            for (int j = 0; j < col; j++)
                cin >> input[i][j];
        //checking
        //cout << input[1][0] << " " << input[0][0]<< endl;
        for (int i = 0; i < row; i++)
        {
            for (int j = 0; j < col; j++)
            {
                if (input[i][j] == 1 && !visitedIsland[i][j])
                {
                    //push neighbour
                    numofIsland++;
                    //processed = true;
                    //cout << i << " " << j << endl ;
                    dfs(input,visitedIsland,i,j);
                }
            }
        }
        if (row > 0 &&  col > 0)
            cout << numofIsland << endl;
    }
    return 0;
}



Measured memory_bytes: 3284