




'''simple docstring'''





def UpperCAmelCase    (       UpperCAmelCase_						):
    # must be
    _a				:							Optional[Any]							       =      [list(UpperCAmelCase_						) for row in matrix]
    if matrix and isinstance(UpperCAmelCase_   ,	UpperCAmelCase_						):
        if isinstance(matrix[0]   ,	UpperCAmelCase_						):
            _a				:							int							       =      0
            for row in matrix:
                if prev_len == 0:
                    _a				:							Any							       =      len(UpperCAmelCase_						)
                    _a				:							Optional[Any]							       =      True
                else:
                    _a				:							List[Any]							       =      prev_len == len(UpperCAmelCase_						)
        else:
            _a				:							Dict							       =      True
    else:
        _a				:							Dict							       =      False

    return result





def UpperCAmelCase    (       UpperCAmelCase_						):
    if check_matrix(UpperCAmelCase_						) and len(UpperCAmelCase_						) > 0:
        _a				:							Tuple							       =      [list(UpperCAmelCase_						) for row in a]
        _a				:							Union[str, Any]							       =      len(UpperCAmelCase_						)
        if isinstance(a[0]   ,	UpperCAmelCase_						):
            _a				:							Union[str, Any]							       =      len(a[0]						)
        else:
            for dat in a:
                print(UpperCAmelCase_						)
            return

        # horizotal printing increasing
        for i in range(0   ,	UpperCAmelCase_						):
            print(a[0][i]						)
        # vertical printing down
        for i in range(1   ,	UpperCAmelCase_						):
            print(a[i][mat_col - 1]						)
        # horizotal printing decreasing
        if mat_row > 1:
            for i in range(mat_col - 2   ,	-1   ,	-1						):
                print(a[mat_row - 1][i]						)
        # vertical printing up
        for i in range(mat_row - 2   ,	0   ,	-1						):
            print(a[i][0]						)
        _a				:							List[str]							       =      [row[1 : mat_col - 1] for row in a[1 : mat_row - 1]]
        if len(UpperCAmelCase_						) > 0:
            spiral_print_clockwise(UpperCAmelCase_						)
        else:
            return
    else:
        print("""Not a valid matrix"""						)
        return





def UpperCAmelCase    (       UpperCAmelCase_						):
    if matrix:
        return list(matrix.pop(0						)						) + spiral_traversal(list(zip(*UpperCAmelCase_						)						)[::-1]						)
    else:
        return []


# driver code
if __name__ == "__main__":
  import doctest

  doctest.testmod()

  a		:	str       =      [[1, 2, 3, 4], [5, 6, 7, 8], [9, 1_0, 1_1, 1_2]]
  spiral_print_clockwise(a)






'''simple docstring'''







import math
from timeit import timeit







def _UpperCamelCase			(	__A       )				->						int:


      '''simple docstring'''



      UpperCamelCase__      =							0
      UpperCamelCase__      =							abs(__A       )
      while True:
            UpperCamelCase__      =							n // 10
            digits += 1
            if n == 0:
                  break
      return digits







def _UpperCamelCase			(	__A       )				->						int:


      '''simple docstring'''



      return 1 if n == 0 else math.floor(math.log(abs(__A       ) ,     10       ) + 1       )







def _UpperCamelCase			(	__A       )				->						int:


      '''simple docstring'''



      return len(str(abs(__A       )       )       )







def _UpperCamelCase			(	)				->						None:


      '''simple docstring'''



      from collections.abc import Callable

      def benchmark_a_function(__A ,     __A       ) -> None:
            UpperCamelCase__      =							F'''{func.__name__}({value})'''
            UpperCamelCase__      =							timeit(F'''__main__.{call}''' ,     setup="import __main__"       )
            print(F'''{call}: {func(__A       )} -- {timing} seconds'''       )

      for value in (262144, 1125899906842624, 1267650600228229401496703205376):
            for func in (num_digits, num_digits_fast, num_digits_faster):
                  benchmark_a_function(__A ,     __A       )
            print()


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  benchmark()





