#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long double PI = 3.14159265;
long long int powerWithMod(long long int base, long long int exponent,
                           long long int modulus = LLONG_MAX) {
  long long int result = 1;
  base %= modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % modulus;
    exponent >>= 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long int modInverse(long long int a, long long int m = MOD) {
  return powerWithMod(a, m - 2, m);
}
int n, m, k, x;
map<int, vector<int>> a;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k >> m;
  while (n--) {
    cin >> x;
    a[x % m].push_back(x);
    if (a[x % m].size() == k) {
      cout << "Yes\n";
      for (auto& i : a[x % m]) cout << i << " ";
      cout << "\n";
      return 0;
    }
  }
  cout << "No\n";
  return 0;
}
