




class 						_A :  # Public class to implement a graph






  def __init__(  self		:     List[Any]				,						_A		:     int				,						_A		:     int				,						_A		:     list[list[bool]]				)		->   None:






       """simple docstring"""







       lowercase :       Tuple       =			row
       lowercase :       Union[str, Any]       =			col
       lowercase :       int       =			graph






  def  __a      (  self		:     List[Any]				,						_A		:     int				,						_A		:     int				,						_A		:     list[list[bool]]				)		->   bool:






       """simple docstring"""







       return (
           0 <= i < self.ROW
           and 0 <= j < self.COL
           and not visited[i][j]
           and self.graph[i][j]
       )






  def  __a      (  self		:     int				,						_A		:     int				,						_A		:     int				,						_A		:     list[list[bool]]				)		->   None:






       """simple docstring"""







       lowercase :       List[str]       =			[-1, -1, -1, 0, 0, 1, 1, 1]  # Coordinate order
       lowercase :       Dict       =			[-1, 0, 1, -1, 1, -1, 0, 1]
       lowercase :       Dict       =			True  # Make those cells visited
       for k in range(8				):
            if self.is_safe(i + row_nbr[k]				,						j + col_nbr[k]				,						_A				):
                 self.diffs(i + row_nbr[k]				,						j + col_nbr[k]				,						_A				)






  def  __a      (  self		:     List[str]				)		->   int:  # And finally, count all islands.






       """simple docstring"""







       lowercase :       List[str]       =			[[False for j in range(self.COL				)] for i in range(self.ROW				)]
       lowercase :       Optional[Any]       =			0
       for i in range(self.ROW				):
            for j in range(self.COL				):
                 if visited[i][j] is False and self.graph[i][j] == 1:
                      self.diffs(_A				,						_A				,						_A				)
                      count += 1
       return count





class 						_A :  # Public class to implement a graph






  def __init__(  self		:     List[Any]				,						_A		:     int				,						_A		:     int				,						_A		:     list[list[bool]]				)		->   None:






       """simple docstring"""







       lowercase :       Tuple       =			row
       lowercase :       Union[str, Any]       =			col
       lowercase :       int       =			graph






  def  __a      (  self		:     List[Any]				,						_A		:     int				,						_A		:     int				,						_A		:     list[list[bool]]				)		->   bool:






       """simple docstring"""







       return (
           0 <= i < self.ROW
           and 0 <= j < self.COL
           and not visited[i][j]
           and self.graph[i][j]
       )






  def  __a      (  self		:     int				,						_A		:     int				,						_A		:     int				,						_A		:     list[list[bool]]				)		->   None:






       """simple docstring"""







       lowercase :       List[str]       =			[-1, -1, -1, 0, 0, 1, 1, 1]  # Coordinate order
       lowercase :       Dict       =			[-1, 0, 1, -1, 1, -1, 0, 1]
       lowercase :       Dict       =			True  # Make those cells visited
       for k in range(8				):
            if self.is_safe(i + row_nbr[k]				,						j + col_nbr[k]				,						_A				):
                 self.diffs(i + row_nbr[k]				,						j + col_nbr[k]				,						_A				)






  def  __a      (  self		:     List[str]				)		->   int:  # And finally, count all islands.






       """simple docstring"""







       lowercase :       List[str]       =			[[False for j in range(self.COL				)] for i in range(self.ROW				)]
       lowercase :       Optional[Any]       =			0
       for i in range(self.ROW				):
            for j in range(self.COL				):
                 if visited[i][j] is False and self.graph[i][j] == 1:
                      self.diffs(_A				,						_A				,						_A				)
                      count += 1
       return count