49 lines
855 B
Java
49 lines
855 B
Java
package chelper;
|
|
|
|
import io.InputReader;
|
|
import io.OutputWriter;
|
|
import misc.SimpleSavingChelperSolution;
|
|
|
|
|
|
public class B extends SimpleSavingChelperSolution {
|
|
|
|
public void solve(int testNumber, InputReader in, OutputWriter out) {
|
|
wrapSolve(testNumber, in, out);
|
|
}
|
|
|
|
@Override
|
|
public void solve(int testNumber) {
|
|
int n = in.nextInt();
|
|
int k = in.nextInt();
|
|
int m = in.nextInt();
|
|
|
|
int[] a = in.nextIntArray(n);
|
|
|
|
int[] mods = new int[m];
|
|
|
|
boolean ok = false;
|
|
int goodMod = -1;
|
|
|
|
for (int i : a) {
|
|
mods[i % m]++;
|
|
if (mods[i % m] >= k) {
|
|
ok = true;
|
|
goodMod = i % m;
|
|
}
|
|
}
|
|
|
|
if (!ok) {
|
|
out.println("No");
|
|
return;
|
|
}
|
|
out.println("Yes");
|
|
|
|
for (int i : a) {
|
|
if (i % m == goodMod && k > 0) {
|
|
k--;
|
|
out.print(i + " ");
|
|
}
|
|
}
|
|
}
|
|
}
|