#include <stdio.h>
#include <algorithm>

using namespace std;

#define MAX_N 300010

int n, m, k, p;
int A[MAX_N];
int v[32][32][8], ind[32][32];

inline int cmp(int x, int y) {
	return x > y;
}

void prec() {
	for (int i = n; i >= 1; i--)
		for (int j = 2; j <= 20; j++) {
            int r = A[i] % j;
        	
			if (ind[j][r] < 5) v[j][r][++ind[j][r]] = A[i];
		}
}

int main() {

	freopen("tricouri.in", "r", stdin);
	freopen("tricouri.out", "w", stdout);

	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++)
		scanf("%d", &A[i]);
	sort(A + 1, A + n + 1, cmp);

	prec();

	return 0;
}