#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

vector<int> consistency(int n, int k, int m){

    unordered_map<int,int> f;
    for(int i=0; i<n; i++){
        int mod = a[i]%m;

        f[mod]++;
    }

    int maxi = 0;
    int maxMod = 0;

    for(auto& ff : f){
        if(ff.second > maxi){
            maxi = ff.second;
            maxMod = ff.first;
        }
    }   

    if(maxi < k) return {};

    vector<int> ans;
    for(int i=0; i<n; i++){
        int mod = a[i]%m;
        if(mod == maxMod){
            ans.push_back(a[i]);
        }
        if(ans.size() == k) break;
    }

    return ans;
}















vector<int>  practice(int n, int k, int m){


}





void solve() {
    
    int n, k, m;
    cin>> n >> k >> m;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    auto ans = consistency(n, k, m);
    if(ans.empty()){
        cout << "No" << endl;
    }
    else{
        cout << "Yes" << endl;
        for(auto& it : ans) cout << it << " "; cout << endl;
    }


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    while (t--) {
        solve();
    }

    return 0;
}