




def 				_a       (				lowerCAmelCase   )->  bool:
		# must be
		SCREAMING_SNAKE_CASE_							=       [list(lowerCAmelCase   ) for row in matrix]
		if matrix and isinstance(lowerCAmelCase						,	lowerCAmelCase   ):
				if isinstance(matrix[0]						,	lowerCAmelCase   ):
						SCREAMING_SNAKE_CASE_							=       0
						for row in matrix:
								if prev_len == 0:
										SCREAMING_SNAKE_CASE_							=       len(lowerCAmelCase   )
										SCREAMING_SNAKE_CASE_							=       True
								else:
										SCREAMING_SNAKE_CASE_							=       prev_len == len(lowerCAmelCase   )
				else:
						SCREAMING_SNAKE_CASE_							=       True
		else:
				SCREAMING_SNAKE_CASE_							=       False

		return result


def 				_a       (				lowerCAmelCase   )->  None:
		if check_matrix(lowerCAmelCase   ) and len(lowerCAmelCase   ) > 0:
				SCREAMING_SNAKE_CASE_							=       [list(lowerCAmelCase   ) for row in a]
				SCREAMING_SNAKE_CASE_							=       len(lowerCAmelCase   )
				if isinstance(a[0]						,	lowerCAmelCase   ):
						SCREAMING_SNAKE_CASE_							=       len(a[0]   )
				else:
						for dat in a:
								print(lowerCAmelCase   )
						return

				# horizotal printing increasing
				for i in range(0						,	lowerCAmelCase   ):
						print(a[0][i]   )
				# vertical printing down
				for i in range(1						,	lowerCAmelCase   ):
						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]   )
				SCREAMING_SNAKE_CASE_							=       [row[1 : mat_col - 1] for row in a[1 : mat_row - 1]]
				if len(lowerCAmelCase   ) > 0:
						spiral_print_clockwise(lowerCAmelCase   )
				else:
						return
		else:
				print('Not a valid matrix'   )
				return


def 				_a       (				lowerCAmelCase   )->  list[int]:
		if matrix:
				return list(matrix.pop(0   )   ) + spiral_traversal(list(zip(*lowerCAmelCase   )   )[::-1]   )
		else:
				return []


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

						doctest.testmod()

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





import unittest

from transformers import load_tool

from .test_tools_common import ToolTesterMixin


SCREAMING_SNAKE_CASE:    List[str]											=   '''
Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf originally as a company that developed a chatbot app targeted at teenagers.[2] After open-sourcing the model behind the chatbot, the company pivoted to focus on being a platform for machine learning.

In March 2021, Hugging Face raised $40 million in a Series B funding round.[3]

On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model.[4] In 2022, the workshop concluded with the announcement of BLOOM, a multilingual large language model with 176 billion parameters.[5]
'''



class       lowercase_		(unittest.TestCase       ,  SCREAMING_SNAKE_CASE__   ):



						def   __a				( self  :      Dict     ):

								"""simple docstring"""

								SCREAMING_SNAKE_CASE_							=       load_tool('summarization'     )
								self.tool.setup()
								SCREAMING_SNAKE_CASE_							=       load_tool('summarization'				,       remote=snake_case__     )



						def   __a				( self  :      Union[str, Any]     ):

								"""simple docstring"""

								SCREAMING_SNAKE_CASE_							=       self.tool(snake_case__     )
								self.assertEqual(
								    snake_case__				,       'Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM.'				,       )



						def   __a				( self  :      List[str]     ):

								"""simple docstring"""

								SCREAMING_SNAKE_CASE_							=       self.remote_tool(snake_case__     )
								self.assertEqual(
								    snake_case__				,       'Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM.'				,       )



						def   __a				( self  :      Optional[Any]     ):

								"""simple docstring"""

								SCREAMING_SNAKE_CASE_							=       self.tool(text=snake_case__     )
								self.assertEqual(
								    snake_case__				,       'Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM.'				,       )






						def   __a				( self  :      List[Any]     ):

								"""simple docstring"""

								SCREAMING_SNAKE_CASE_							=       self.remote_tool(text=snake_case__     )
								self.assertEqual(
								    snake_case__				,       'Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM.'				,       )