input: from typing import List
  
  def find_highest_sum_triplets(numbers: List[int]) -> List[int]:
      """ Find and return a triplet from the given list of numbers whose sum is the highest.
      If there are multiple triplets with the same highest sum, return the first found.
      If the list has less than 3 elements, return an empty list.
      >>> find_highest_sum_triplets([1, 2, 3, 4, 5])
      [3, 4, 5]
      >>> find_highest_sum_triplets([10, 20, 10, 30, 50, 10])
      [20, 30, 50]
      """
output:     if len(numbers) < 3:
          return []
      
      highest_sum = float('-inf')
      result_triplet = []
      
      for i in range(len(numbers) - 2):
          for j in range(i + 1, len(numbers) - 1):
              for k in range(j + 1, len(numbers)):
                  current_sum = numbers[i] + numbers[j] + numbers[k]
                  if current_sum > highest_sum:
                      highest_sum = current_sum
                      result_triplet = [numbers[i], numbers[j], numbers[k]]
      
      return result_triplet