B"Consider an undirected graph G with n vertices. There is a value a_i in each vertex. Two vertices i and j are connected with an edge if and only if gcd(a_i, a_j) > 1 , where gcd(x, y) denotes the greatest common divisor (GCD) of integers x and y . Consider a set of vertices. Let's call a vertex in this set fair if it is connected with an edge with all other vertices in this set. You need to find a set of k vertices (where k is a given integer, 2 cdot k <= n ) where all vertices are fair or all vertices are not fair. One can show that such a set always exists. The first line contains integers n and k ( 6 <= q 2 cdot k <= q n <= q 10^5 ) -- the number of vertices and parameter k . The second line contains n integers a_1, a_2, ldots, a_n ( 2 <= a_i <= 10^7 ) -- the values in the vertices. Print exactly k distinct integers -- the indices of the vertices in the chosen set in any order. In the first test case, set {2, 4, 5 } is an example of set where no vertices are fair. The vertex 2 does not share an edge with vertex 4 since gcd(15, 8) = 1 . The vertex 4 does not share an edge with vertex 2 . The vertex 5 does not share an edge with vertex 2 . In the second test case, set {8, 5, 6, 4 } is an example of a set where all vertices are fair. "...