

from __future__ import annotations

from collections import namedtuple






def        snake_case__		(    lowerCamelCase_     ,				lowerCamelCase_     ,				lowerCamelCase_		):
							A      :					Optional[int]      		=					namedtuple('''result'''     ,				'''name value'''		)
							if (voltage, current, power).count(0		) != 1:
														raise ValueError('''Only one argument must be 0'''		)
							elif power < 0:
														raise ValueError(
														    '''Power cannot be negative in any electrical/electronics system'''		)
							elif voltage == 0:
														return result('''voltage'''     ,				power / current		)
							elif current == 0:
														return result('''current'''     ,				power / voltage		)
							elif power == 0:
														return result('''power'''     ,				float(round(abs(voltage * current		)     ,				2		)		)		)
							else:
														raise ValueError('''Exactly one argument must be 0'''		)


if __name__ == "__main__":
		import doctest

		doctest.testmod()












class 							UpperCamelCase_       :  # Public class to implement a graph

    '''simple docstring'''






    def __init__(     self :      str   ,					UpperCAmelCase__ :      int   ,					UpperCAmelCase__ :      int   ,					UpperCAmelCase__ :      list[list[bool]])		->None:





           '''simple docstring'''

           A__ 					=       row
           A__ 					=       col
           A__ 					=       graph


    def 			SCREAMING_SNAKE_CASE				(     self :      Any   ,					UpperCAmelCase__ :      int   ,					UpperCAmelCase__ :      int   ,					UpperCAmelCase__ :      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 			SCREAMING_SNAKE_CASE				(     self :      Optional[int]   ,					UpperCAmelCase__ :      int   ,					UpperCAmelCase__ :      int   ,					UpperCAmelCase__ :      list[list[bool]])		->None:





           '''simple docstring'''

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





    def 			SCREAMING_SNAKE_CASE				(     self :      Optional[Any])		->int:  # And finally, count all islands.





           '''simple docstring'''

           A__ 					=       [[False for j in range(self.COL)] for i in range(self.ROW)]
           A__ 					=       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(UpperCAmelCase__   ,					UpperCAmelCase__   ,					UpperCAmelCase__)
                                count += 1
           return count


