def solution(info, query):
    
    class Member_Info:
        def __init__(self, data):
            self.lang = data[0]
            self.job_group = data[1]
            self.career = data[2]
            self.soul_food = data[3]
            self.score = data[4]
            self.down = None
            
    class Member_Search:
        def __init__(self, data):
            self.head = Member_Info(data)
            
        def insert(self, data):
            self.current_node = self.head
            while True:
                if self.current_node.down == None:
                    self.current_node.down = Member_Info(data)
                    break
                else:
                    self.current_node = self.current_node.down
                    
        def search(self, target):
            self.current_node = self.head
            
            count = 0
            while self.current_node:
                if target[0] == '-' or self.current_node.lang == target[0]:
                    if target[1] == '-' or self.current_node.job_group == target[1]:
                        if target[2] == '-' or self.current_node.career == target[2]:
                            if target[3] == '-' or self.current_node.soul_food == target[3]:
                                if int(self.current_node.score) >= int(target[4]):
                                    count += 1
                                    
                self.current_node = self.current_node.down
                
            return count
                
            
#     -------------------------

    head = info[0]
    head = head.split()
    tree = Member_Search(head)
    
    for data in info[1:]:
        data = data.split()
        tree.insert(data)
        
    answer = []
    
    for target_list in query:
        target_list = target_list.split()
        target = []
        target.append(target_list[0])
        target.append(target_list[2])
        target.append(target_list[4])
        target.append(target_list[6])
        target.append(target_list[7])

        
        count = tree.search(target)
        
        answer.append(count)
        
    return answer