CF876B.Divisiblity of Differences

You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.

Numbers can be repeated in the original multiset and in the multiset of selected numbers, but number of occurrences of any number in multiset of selected numbers should not exceed the number of its occurrences in the original multiset.

给你一个包含 $n$ 个整数的多重集。你需要从中恰好选出 $k$ 个数，使得其中任意两个数之差都能被 $m$ 整除；若无法做到，则需说明这是不可能的。

原始多重集中可能存在重复的数，选出的多重集中也可能包含重复的数，但选出的多重集中任一数字的出现次数不得超过其在原始多重集中的出现次数。

First line contains three integers n, k and m (2 ≤ k ≤ n ≤ 100 000, 1 ≤ m ≤ 100 000) — number of integers in the multiset, number of integers you should select and the required divisor of any pair of selected integers.

Second line contains n integers _a_1, _a_2, ..., a__n (0 ≤ a__i ≤ 109) — the numbers in the multiset.

第一行包含三个整数 $n$、$k$ 和 $m$（满足 $2 \leq k \leq n \leq 100\,000$，$1 \leq m \leq 100\,000$）—— 分别表示多重集中的整数个数、需选出的整数个数，以及所选任意两个整数必须具有的公因数 $m$。

第二行包含 $n$ 个整数 $a_1,\,a_2,\,...,\,a_n$（满足 $0 \leq a_i \leq 10^9$）—— 多重集中的各个数字。

If it is not possible to select k numbers in the desired way, output «No» (without the quotes).

Otherwise, in the first line of output print «Yes» (without the quotes). In the second line print k integers _b_1, _b_2, ..., b__k — the selected numbers. If there are multiple possible solutions, print any of them.

如果无法按要求选出 $k$ 个数，则输出 No（不带引号）。

否则，在输出的第一行打印 Yes（不带引号）；在第二行打印 $k$ 个整数 $b_1,\ b_2,\ \dots,\ b_k$ —— 即所选出的数。若存在多种可能的解，输出任意一种即可。