def sum_gp(a,n,r):
 import math
 
 total = (a * (1 - math.pow(r, n ))) / (1- r)
 return total
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums