CF27D Ring Road 2

It is well known that Berland has $ n $ cities, which form the Silver ring — cities $ i $ and $ i+1 $ ( $ 1

The first line contains two integers $ n $ and $ m $ ( $ 4

If it is impossible to build the roads in such a way that no two roads intersect, output Impossible. Otherwise print $ m $ characters. $ i $ -th character should be i, if the road should be inside the ring, and o if the road should be outside the ring. If there are several solutions, output any of them.