

def      snake_case__							(  lowerCAmelCase_,       lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=len(__lowercase     )
     SCREAMING_SNAKE_CASE 		=len(__lowercase     )
     SCREAMING_SNAKE_CASE 		=(
         first_input_list_length
         if first_input_list_length > second_input_list_length
         else second_input_list_length
     )
     SCREAMING_SNAKE_CASE 		=[]
     for char_count in range(__lowercase     ):
          if char_count < first_input_list_length:
               output_result_list.append(first_input_list[char_count]     )
          if char_count < second_input_list_length:
               output_result_list.append(second_input_list[char_count]     )

     return output_result_list


if __name__ == "__main__":
 print(alternative_list_arrange(["A", "B", "C"], [1, 2, 3, 4, 5]), end=" ")





"""simple docstring"""


from math import factorial






def   a__			(					__lowercase  ,      __lowercase )						->						List[Any]:
				return factorial(__lowercase ) / (factorial(__lowercase ) * factorial(n - r ))






def   a__			(					)						->						List[str]:
				_A       	=      0

				for i in range(1  ,      101 ):
								for j in range(1  ,      i + 1 ):
												if combinations(__lowercase  ,      __lowercase ) > 1E6:
																total += 1
				return total


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