Codeforces 876 B Divisiblity of Differences

#include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdio>
#include <algorithm>
#define N 100010
#define LL __int64
#define inf 0x3f3f3f3f 0
#define lson l,mid,ans<<1
#define rson mid+1,r,ans<<1|1
#define getMid (l+r)>>1
#define movel ans<<1
#define mover ans<<1|1
const int mod = 1000000007;
using namespace std;
int num;
vector<int>flag
;
int main() {
cin.sync_with_stdio(false);
int n, m, k;
while (cin >> n >> k >> m) {
for (int i = 0; i < N; i++) {
flag[i].clear();
}
for (int i = 0; i < n; i++) {
cin >> num;
flag[num%m].push_back(num);
if (flag[num%m].size() == k) {
num %= m;
cout << "Yes" << endl;
for (int i = 0; i < k; i++) {
cout << flag[num][i] << " ";
}
cout << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}