#include <bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

const int N = 2000005;
int n, m;
bool vis[N];
vector <int> pos;
ll sum = 0;
ll ans[N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1, x; i <= n; i++) {
		cin >> x, vis[x] = 1;
		sum += x;
	}
	for (int i = 1; i <= 2e6; i++) {
		pos.clear();
		ll t = sum;
		for (int j = i; j <= 2e6; j += i) {
			if (vis[j]) pos.push_back(j), t -= j;
		}
		reverse(pos.begin(), pos.end());
		for (int j = 0; j < (int)pos.size(); j++) ans[n - pos.size() + j + 1] = max(ans[n - pos.size() + j + 1], t + i), t += pos[j];
	}
	for (int i = 1; i <= m; i++) cout << ans[i] << ' ';
	QwQ330AwA;
}