{"raw_statement":[{"iden":"statement","content":"You are going on a long road trip, and want to know what the maximum speed limit is in each state that you are traveling through. \n\nThe first line of input contains a positive integer _S_, indicating the number of states that are in the database. The next _S_ lines each contain a string representing the name of the state, a space, and an integer representing the maximum speed limit in that state. Names of states will not contain spaces. The next line of input contains a positive integer _T_ indicating the number of test cases that follow. Each test case will consist of a state name.\n\nFor each of the _T_ test cases, output a single integer: the maximum speed limit in the given state, from the database.\n\n"},{"iden":"input","content":"The first line of input contains a positive integer _S_, indicating the number of states that are in the database. The next _S_ lines each contain a string representing the name of the state, a space, and an integer representing the maximum speed limit in that state. Names of states will not contain spaces. The next line of input contains a positive integer _T_ indicating the number of test cases that follow. Each test case will consist of a state name."},{"iden":"output","content":"For each of the _T_ test cases, output a single integer: the maximum speed limit in the given state, from the database."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ S \\in \\mathbb{Z}^+ $ be the number of states in the database.  \nLet $ D = \\{ (s_i, v_i) \\mid i \\in \\{1, \\dots, S\\} \\} $ be the database, where:  \n- $ s_i $ is a string denoting the name of state $ i $,  \n- $ v_i \\in \\mathbb{Z}^+ $ is the maximum speed limit in state $ s_i $.  \n\nLet $ T \\in \\mathbb{Z}^+ $ be the number of test cases.  \nLet $ Q = (q_1, q_2, \\dots, q_T) $ be a sequence of state names (queries), where each $ q_j $ is a string.\n\n**Constraints**  \n1. $ 1 \\le S \\le 100 $  \n2. $ 1 \\le T \\le 100 $  \n3. Each $ s_i $ and $ q_j $ is a non-empty string without spaces.  \n4. Each $ v_i \\in \\{1, 2, \\dots, 150\\} $  \n\n**Objective**  \nFor each query $ q_j \\in Q $, output the speed limit $ v_i $ such that $ (s_i, v_i) \\in D $ and $ s_i = q_j $.","simple_statement":"Given a list of states and their speed limits, for each query state, output its speed limit.","has_page_source":false}