Apply permutation#3913

Apply permutation

1 second
64 megabytes
Very easy

In the Olympic swimming competition, another race has just concluded, and Petro has noted the order in which the athletes finished based on their lane numbers. For example, the record "2 0 1" indicates that the athlete in lane won the gold medal, the athlete in lane took silver, and the athlete in lane earned bronze. (Note that lanes are numbered starting from zero.) Petro also has the starting protocol, which shows the initial lane assignments. For instance, the protocol "Phelps Thorpe Popov" means Phelps started in lane , Thorpe in lane , and Popov in lane .

Petro now wants to create the final results table, listing the athletes' surnames in the order they finished. Your task is to assist him.

Input

The first line of input contains () numbers a_0, a_1, \ldots, a_{n-1} representing the order in which the athletes in the lanes finished. It is guaranteed that each number from to n-1 appears exactly once.

The second line contains the starting protocol: surnames (each is a combination of Latin letters and digits, without spaces), separated by spaces.

Output

Output the final results table by listing the surnames of the athletes in the order they finished. Print the surnames in a single line, separated by a single space.

Examples

Example 1

Loading
Loading