#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
  cerr << "{";
  _print(p.first);
  cerr << ",";
  _print(p.second);
  cerr << "}";
}
template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
const long long mod = 1e9 + 7;
const long long INF = 1e18;
const int N = 100001;
void solve() {
  int n, k, m;
  cin >> n >> k >> m;
  int a[n];
  vector<int> v(10000001, 0);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    v[a[i] % m]++;
  }
  int idx = -1;
  for (int i = 0; i < m; i++) {
    if (v[i] >= k) {
      idx = i;
      break;
    }
  }
  if (idx == -1) {
    cout << "No" << endl;
    return;
  }
  cout << "Yes" << endl;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] % m == idx) {
      cnt++;
      if (cnt <= k) {
        cout << a[i] << ' ';
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  { solve(); }
  return 0;
}
