Codeforces Round #441 (Div. 2) Divisiblity of Differences

http://codeforces.com/problemset/problem/876/B

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 a1, a2, …, an (0 ≤ ai ≤ 109) — 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 b1, b2, …, bk — 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个数字，要求这k个数字两两之差能被m整除。如果可以输出Ｙｅｓ和这ｍ个数字，否则输出Ｎｏ。

题解

由于数据太大，不能直接暴力求解
我们先对每个数进行求余得到ｘ[i]，计算余数为ｘ[i]的数的个数b[i]
可以知道这些余数相等的数相减之后在除以ｍ就可以整除了
所以只要b[i]大于ｋ就说明有ｋ个符合题意的数字
这时候我们在进行遍历，把ｋ个数除以ｍ余x[i]的数输出就行了

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int a[100100],b[100100],ans[100000],t;
int main()
{
    int n,k,m;
    scanf("%d%d%d",&n,&k,&m);
    memset(b,0,sizeof(b));
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        b[a[i]%m]++;
    }
    for(int i=0;i<m;i++)
    {
        if(b[i]>=k)
        {
            printf("Yes\n");
            for(int j=0;j<n;j++)
                if(a[j]%m==i)
                {
                    ans[t++]=a[j];
                    if(t>=k)
                        break;
                }
            for(int i=0;i<k-1;i++)
                cout << ans[i] << ' ';
            cout << ans[k-1] << endl;
            return 0;
        }
    }
    cout << "No" << endl;
    return 0;
}