A11131 | Leha and Function

Leha like all kinds of strange things. Recently he liked the function $F(n,k)$ . Consider all possible $k$ -element subsets of the set $[1,2,...,n]$ . For subset find minimal element in it. $F(n,k)$ — mathematical expectation of the minimal element among all $k$ -element subsets.

But only function does not interest him. He wants to do interesting things with it. Mom brought him two arrays $A$ and $B$ , each consists of $m$ integers. For all $i,j$ such that $1<=i,j<=m$ the condition $A_{i}>=B_{j}$ holds. Help Leha rearrange the numbers in the array $A$ so that the sum  is maximally possible, where $A'$ is already rearranged array.

First line of input data contains single integer $m$ ( $1<=m<=2·10^{5}$ ) — length of arrays $A$ and $B$ .

Next line contains $m$ integers $a_{1},a_{2},...,a_{m}$ ( $1<=a_{i}<=10^{9}$ ) — array $A$ .

Next line contains $m$ integers $b_{1},b_{2},...,b_{m}$ ( $1<=b_{i}<=10^{9}$ ) — array $B$ .

Output $m$ integers $a'_{1},a'_{2},...,a'_{m}$ — array $A'$ which is permutation of the array $A$ .