input: Write a function to take a list of integers and return the largest 3 numbers in descending order. If the list has fewer than 3 numbers, return all of them. If the list is empty, return an empty list.
  
  def top_three(numbers):
      if len(numbers) == 0:
          return []
      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([3, 1, 2]) == [3, 2, 1]
  assert top_three([8]) == [8]
  assert top_three([]) == []
output: def top_three(numbers):
      if len(numbers) == 0:
          return []
      sorted_numbers = sorted(numbers, reverse=True)
      return sorted_numbers[:3]