Divisiblity of Differences

题意翻译

给出n个整数的集合。你应该准确地选择它们中的k个数，使它们之间的差可以被m除，除非这是不可能的。 输入第一行包括一个n，一个k，一个m； (2<=k<=n<=100000,1<=m<=100000) 第二行为n个整数a1,a2,...,an ( 0<=ai<=$10^9$ ) 如果满足要求，在第一行输出"Yes"（没有引号），并且在第二行输出所选的k个数。（如果有多个可能的解决方案，打印其中的任何一个。） 如果不满足要求，输出"No"（没有引号）。 By @SocietyNiu

题目描述

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.

输入输出格式

输入格式

First line contains three integers $ n $ , $ k $ and $ m $ ( $ 2<=k<=n<=100000 $ , $ 1<=m<=100000 $ ) — 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}<=10^{9} $ ) — the numbers in the multiset.

输出格式

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.

输入输出样例

输入样例 #1

3 2 3
1 8 4

输出样例 #1

Yes
1 4 

输入样例 #2

3 3 3
1 8 4

输出样例 #2

No

输入样例 #3

4 3 5
2 7 7 7

输出样例 #3

Yes
2 7 7