Question: 
Write a function to find the smallest integers from a given list of numbers using heap queue algorithm.


Model's Code:
import heapq

def heap_queue_smallest(numbers, k):
    return heapq.nsmallest(k, numbers)



Sample Correct Code:
import heapq as hq
def heap_queue_smallest(nums,n):
  smallest_nums = hq.nsmallest(n, nums)
  return smallest_nums


Asserts:
assert heap_queue_smallest( [25, 35, 22, 85, 14, 65, 75, 25, 58],3)==[14, 22, 25] 
assert heap_queue_smallest( [25, 35, 22, 85, 14, 65, 75, 25, 58],2)==[14, 22]
assert heap_queue_smallest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[14, 22, 22, 25, 35]


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 496 of 974: 365/496 (73.58870967741935%): success