






"""simple docstring"""





def      __lowercase       (     a			:					list							,		a			:					list			)       ->       list:
      __snake_case   :     int	      =len(a			)
      __snake_case   :     int	      =len(a			)
      __snake_case   :     int	      =(
          first_input_list_length
          if first_input_list_length > second_input_list_length
          else second_input_list_length
      )
      __snake_case   :     list	      =[]
      for char_count in range(a			):
            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 itertools import combinations, product



def      __lowercase       (     a			:					int							,		a			:					int							,		a			:					int							,		a			:					int			)       ->       bool:
      if xa == ya == 0 or xa == ya == 0:
            return False
      __snake_case   :     Any	      =xa * xa + ya * ya
      __snake_case   :     Tuple	      =xa * xa + ya * ya
      __snake_case   :     List[Any]	      =(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
      return (
          a_square + b_square == c_square
          or a_square + c_square == b_square
          or b_square + c_square == a_square
      )



def      __lowercase       (     a			:					int = 50			)       ->       int:
      return sum(
          1
          for pta, pta in combinations(product(range(limit + 1			)							,		repeat=2			)							,		2			)
          if is_right(*a							,		*a			)			)


if __name__ == "__main__":
    print(F'''{solution() = }''')


