input: Write a function to find the top 3 numbers from a given array of integers. Return the top 3 numbers as a list. If there are fewer than 3 numbers in the list, return all available numbers.
  def top_three(numbers):
      sorted_numbers = sorted(numbers, reverse=True)
      return sorted_numbers[:3]
  
  assert top_three([7, 13, 5, 8, 50, 11, 64, 48])==[64, 50, 48]
  assert top_three([1, 2])==[2, 1]
  assert top_three([])==[]
  assert top_three([3, 5, 10, 1, 2])==[10, 5, 3]
  assert top_three([4, 3, 1, 2])==[4, 3, 2]
output: def top_three(numbers):
      sorted_numbers = sorted(numbers, reverse=True)
      return sorted_numbers[:3]