def most_common_elem(s,a):
  from collections import Counter 
  
  most_common_elem=Counter(s).most_common(a)
  return most_common_elem
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums