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

using namespace std;

#define MAX_N 300010

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

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

int main() {

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

	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		int x;
		scanf("%d", &x);
		for (int j = 2; j <= 20; j++) {
			int r = x % j;
			
			v[j][r][++ind[j][r]] = x;

			sort(v[j][r] + 1, v[j][r] + 6, cmp);

			if (ind[j][r] > 5) ind[j][r] = 5;
		}
	}

	return 0;
}