

'''simple docstring'''

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

	return result

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

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

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


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

						doctest.testmod()

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










"""simple docstring"""


from itertools import permutations

def 					_lowerCAmelCase (  lowercase_ = 5		):
						if gon_side < 3 or gon_side > 5:
												raise ValueError('gon_side must be in the range [3, 5]'		)

						# Since it's 16, we know 10 is on the outer ring
						# Put the big numbers at the end so that they are never the first number
						UpperCAmelCase			 =					list(range(gon_side + 1						,      0						,      -1		)		)
						UpperCAmelCase			 =					list(range(gon_side + 2						,      gon_side * 2 + 1		)		)

						for perm in permutations(small_numbers + big_numbers		):
												UpperCAmelCase			 =					generate_gon_ring(lowercase_						,      list(lowercase_		)		)
												if is_magic_gon(lowercase_		):
																		return int(''.join(str(lowercase_		) for n in numbers		)		)

						UpperCAmelCase			 =					F"""Magic {gon_side}-gon ring is impossible"""
						raise ValueError(lowercase_		)

def 					_lowerCAmelCase (  lowercase_						,      lowercase_		):
						UpperCAmelCase			 =					[0] * (gon_side * 3)
						UpperCAmelCase			 =					perm[0:3]
						perm.append(perm[1]		)

						UpperCAmelCase			 =					1 if gon_side < 5 else 2

						for i in range(1						,      len(lowercase_		) // 3 + magic_number		):
												UpperCAmelCase			 =					perm[2 * i + 1]
												UpperCAmelCase			 =					result[3 * i - 1]
												UpperCAmelCase			 =					perm[2 * i + 2]

						return result

def 					_lowerCAmelCase (  lowercase_		):
						if len(lowercase_		) % 3 != 0:
												raise ValueError('a gon ring should have a length that is a multiple of 3'		)

						if min(numbers[::3]		) != numbers[0]:
												return False

						UpperCAmelCase			 =					sum(numbers[:3]		)

						return all(sum(numbers[i : i + 3]		) == total for i in range(3						,      len(lowercase_		)						,      3		)		)


if __name__ == "__main__":
				print(solution())





