#include <bits/stdc++.h>
const double PI = 3.141592653589793238460;
using namespace std;
long long pows(long long a, long long n, long long m) {
  a = a % m;
  long long res = 1;
  while (n) {
    if (n % 2 != 0) {
      res = (res * a) % m;
      n--;
    } else {
      a = (a * a) % m;
      n = n / 2;
    }
  }
  return res % m;
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
bool isprime(long long n) {
  if (n == 1) {
    return false;
  }
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
bool istrue(string s) {
  int i = 0;
  int j = s.size() - 1;
  while (i < j) {
    if (s[i] == s[j]) {
      i++;
      j--;
    } else {
      return false;
    }
  }
  return true;
}
const int N = 1e5 + 5;
int n, k, m;
int a[N];
vector<int> ar[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> m;
  map<int, int> mp;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    ar[a[i] % m].push_back(a[i]);
  }
  vector<int> ans;
  int flag = 0;
  for (int i = 0; i < N; i++) {
    if (flag == 1) {
      break;
    }
    if (ar[i].size() >= k) {
      flag = 1;
      for (auto x : ar[i]) {
        if (k == 0) {
          break;
        }
        ans.push_back(x);
        k--;
      }
    }
  }
  if (flag == 1) {
    cout << "Yes"
         << "\n";
    for (int res : ans) {
      cout << res << " ";
    }
  } else {
    cout << "No"
         << "\n";
  }
}
