B"You have an array of integers (initially empty). You have to perform q queries. Each query is of one of two types: Find the resulting array after performing all the queries. The first line contains a single integer q ( 1 <= q <= 5 cdot 10^5 ) -- the number of queries. Next q lines contain queries (one per line). Each query is of one of two types: It's guaranteed that there is at least one query of the first type. In a single line, print k integers -- the resulting array after performing all the queries, where k is the number of queries of the first type. In the first example, the array changes as follows: [] rightarrow [3] rightarrow [3, 1] rightarrow [3, 2] rightarrow [3, 2, 2] rightarrow [3, 2, 2, 1] rightarrow [3, 2, 2, 1, 2] rightarrow [3, 2, 2, 3, 2] . In the second example, the array changes as follows: [] rightarrow [1] rightarrow [1, 2] rightarrow [1, 2, 1] rightarrow [1, 2, 1] . In the third example, the array changes as follows: [] rightarrow [] rightarrow [1] rightarrow [1, 4] rightarrow [1, 4, 2] rightarrow [1, 4, 4] rightarrow [1, 3, 3] rightarrow [1, 3, 3, 2] rightarrow [1, 3, 3, 7] . "...