CF840A Leha and Function

Description

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

Input Format

First line of input data contains single integer $ m $ ( $ 1

Output Format

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