def sum_three_smallest_nums(lst):
	
	return sum(sorted([x for x in lst if x > 0])[:3])
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums