{"raw_statement":[{"iden":"statement","content":"Dream Land has $n$ nuclear reactor plants. Each of the plants is positioned on a straight line $p_i$ ($1 <= p_i <= 10^(18)$) At the beginning, all plants are inactive. The president of Dream Land wants to activate exactly $k$ ($1 <= k <= n$) plants in such away the distance between any two active plants is as large as possible. The president assigned this task to you.\n\nThe first line of input consist of two integers $n$ ($1 <= n <= 10^5$) and $k$ ($1 <= k <= n$), the number of nuclear plants and the number of activated plants respectively. The second line consist of $n$ integers which are the positions of the nuclear reactor plants $p_i$ ($1 <= p_i <= 10^(18)$). \n\nThe output consist of exactly $k$ integers the positions of activated plants such as the distance between any two activated plants is as large as possible. If there are multiple answers, print any of them. \n\n"},{"iden":"input","content":"The first line of input consist of two integers $n$ ($1 <= n <= 10^5$) and $k$ ($1 <= k <= n$), the number of nuclear plants and the number of activated plants respectively. The second line consist of $n$ integers which are the positions of the nuclear reactor plants $p_i$ ($1 <= p_i <= 10^(18)$). "},{"iden":"output","content":"The output consist of exactly $k$ integers the positions of activated plants such as the distance between any two activated plants is as large as possible. If there are multiple answers, print any of them. "}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n, k \\in \\mathbb{Z} $ with $ 1 \\leq k \\leq n \\leq 10^5 $.  \nLet $ P = (p_1, p_2, \\dots, p_n) $ be a sequence of real numbers representing plant positions, with $ 1 \\leq p_i \\leq 10^{18} $.  \n\n**Constraints**  \n1. $ P $ is not necessarily sorted.  \n2. Exactly $ k $ plants must be selected from $ P $.  \n\n**Objective**  \nSelect a subset $ S \\subseteq P $ with $ |S| = k $ such that the minimum distance between any two distinct selected plants is maximized. That is, maximize:  \n$$\n\\min_{\\substack{a, b \\in S \\\\ a \\ne b}} |a - b|\n$$  \nOutput any such subset $ S $.","simple_statement":"You are given n plants on a line at positions p_i. You must choose exactly k plants to activate so that the minimum distance between any two activated plants is as large as possible. Output the positions of the k chosen plants.","has_page_source":false}