Divisiblity of Differences

You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.

Numbers can be repeated in the original multiset and in the multiset of selected numbers, but number of occurrences of any number in multiset of selected numbers should not exceed the number of its occurrences in the original multiset.

Input

First line contains three integers n, k and m (2 ≤ k ≤ n ≤ 100 000, 1 ≤ m ≤ 100 000) — number of integers in the multiset, number of integers you should select and the required divisor of any pair of selected integers.

Second line contains n integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁹) — the numbers in the multiset.

Output

If it is not possible to select k numbers in the desired way, output «No» (without the quotes).

Otherwise, in the first line of output print «Yes» (without the quotes). In the second line print k integers b₁, b₂, ..., b_k — the selected numbers. If there are multiple possible solutions, print any of them.

Examples

Input

3 2 3
1 8 4

Output

Yes
1 4 

Input

3 3 3
1 8 4

Output

No

Input

4 3 5
2 7 7 7

Output

Yes
2 7 7 

题意：在n个数字里取k个数，使得任意两个数的差为m的倍数

思路：如果两个数x，y，对m取模的结果相同，则x与y做差后一定为m的倍数，所以直接求每个数对m取模

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int N = 100005;
int Mod[N],arr[N],sum[N];
int main(){
	int n,k,m;
	scanf("%d%d%d",&n,&k,&m);
	for(int i=0;i<n;i++){
		scanf("%d",&arr[i]);
		Mod[arr[i]%m]++;
	}
	int flag=0,x=0;
	for(int i=0;i<N;i++){
		if(Mod[i]>=k){
			flag=1;
			x=i; //取对m取模后为i的数字 
			break;
		}
	}
	if(!flag) cout<<"No"<<endl;
	else{
		cout<<"Yes"<<endl;
		int first=1,s=0;
		for(int i=0;i<n;i++){
			if(arr[i]%m==x){
				if(s==k) break;
				if(first) printf("%d",arr[i]);
				else printf(" %d",arr[i]);
				first=0;
				s++;
			}	
		}
		puts("");
	}
	return 0;
}