def rotate_right(list1,m,n):
  
  result =  list1[-(m):]+list1[:-(n)]
  return result
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums