CF798D Mike and distribution

Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers $ A=[a_{1},a_{2},...,a_{n}] $ and $ B=[b_{1},b_{2},...,b_{n}] $ of length $ n $ each which he uses to ask people some quite peculiar questions. To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select $ k $ numbers $ P=[p_{1},p_{2},...,p_{k}] $ such that $ 1

The first line contains integer $ n $ ( $ 1

On the first line output an integer $ k $ which represents the size of the found subset. $ k $ should be less or equal to . On the next line print $ k $ integers $ p_{1},p_{2},...,p_{k} $ ( $ 1