CF1166E The LCMs Must be Large

题意 有一个长度为$n$（$n

第一行两个数$m,n$。 接下来$m$行，每行第一个整数$k$（$1

如果存在一个序列输出 possible ，否则输出 impossible。

In the first sample, a possible choice for the values of the $ a_i $ is $ 3, 4, 3, 5, 2 $ . On the first day, Dora buys the integers $ 3, 4 $ and $ 3 $ , whose LCM is $ 12 $ , while Swiper buys integers $ 5 $ and $ 2 $ , whose LCM is $ 10 $ . On the second day, Dora buys $ 3, 5 $ and $ 2 $ , whose LCM is $ 30 $ , and Swiper buys integers $ 3 $ and $ 4 $ , whose LCM is $ 12 $ .