code: 
  
  import abc
  import copy
  import dataclasses
  from dataclasses import dataclass
  from typing import ClassVar, Dict, Type, TypeVar
  
  from ..features import Features
  
  
  UpperCAmelCase_       :				Any		   =      TypeVar('''T''', bound='''TaskTemplate''')
  
  
  
  
  
  
  @dataclass(frozen=_lowercase  )
  class     lowerCamelCase_			(  abc.ABC  ):
  	# `task` is not a ClassVar since we want it to be part of the `asdict` output for JSON serialization
  	_lowercase		:      str
  	_lowercase		:      ClassVar[Features]
  	_lowercase		:      ClassVar[Features]
  
  
  
  
  	def 					lowerCAmelCase_					(    self	:    T				,			__A	:    Features       ):
  		return copy.deepcopy(self       )
  
  
  
  
  	@property
  	def 					lowerCAmelCase_					(    self	:    Optional[Any]       ):
  		return Features(**self.input_schema				,			**self.label_schema       )
  
  
  
  
  	@property
  	@abc.abstractmethod
  	def 					lowerCAmelCase_					(    self	:    List[Any]       ):
  		raise NotImplementedError
  
  
  
  
  	@classmethod
  	def 					lowerCAmelCase_					(    cls	:    Type[T]				,			__A	:    dict       ):
  		__A   : Any								= {f.name for f in dataclasses.fields(cls       )}
  		return cls(**{k: v for k, v in template_dict.items() if k in field_names}       )
  
  
  
  
  
  
style_context: 
  
  UpperCAmelCase_       :				str		   =      [
      [0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
      [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0],
      [0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0],
      [0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0],
      [0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0],
      [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0],
      [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0],
      [0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0],
  ]
  def        __SCREAMING_SNAKE_CASE    (      a__						:      int ,a__						:      int ,a__						:      int ,a__						:      int					)				->							bool:
  	return 0 <= row < rows and 0 <= col < cols
  def        __SCREAMING_SNAKE_CASE    (      a__						:      int ,a__						:      int ,a__						:      set ,a__						:      list[list[int]]					)				->							int:
  	__A   : Union[str, Any]								= len(a__					)
  	__A   : Any								= len(mat[0]					)
  	if is_safe(a__ ,a__ ,a__ ,a__					) and (row, col) not in seen and mat[row][col] == 1:
  		seen.add((row, col)					)
  		return (
  		    1
  		    + depth_first_search(row + 1 ,a__ ,a__ ,a__					)
  		    + depth_first_search(row - 1 ,a__ ,a__ ,a__					)
  		    + depth_first_search(a__ ,col + 1 ,a__ ,a__					)
  		    + depth_first_search(a__ ,col - 1 ,a__ ,a__					)
  		)
  	else:
  		return 0
  def        __SCREAMING_SNAKE_CASE    (      a__						:      list[list[int]]					)				->							int:
  	__A   : set								= set()
  
  	__A   : Union[str, Any]								= 0
  	for row, line in enumerate(a__					):
  		for col, item in enumerate(a__					):
  			if item == 1 and (row, col) not in seen:
  				# Maximizing the area
  				__A   : Optional[Any]								= max(a__ ,depth_first_search(a__ ,a__ ,a__ ,a__					)					)
  	return max_area
  
  
  if __name__ == "__main__":
  			import doctest
  
  			print(find_max_area(matrix))  # Output -> 6
  			doctest.testmod()
  
  
  
  
  
  