def filter_data(students,h,w):
    
    result = {k: s for k, s in students.items() if s[0] >=h and s[1] >=w}
    return result    
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums