#include <iostream>
#include <cstdio>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <limits>
#include <tuple>
#include <stack>
#include <bitset>
#include <cstring>
#include <sstream>
#include <functional>
#include <random>
#define int long long
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
map<int, int> mp;
for (auto& e : a) {
cin >> e;
++mp[e];
}
int ans = -1;
for (int i = *min_element(a.begin(), a.end()); i < *max_element(a.begin(), a.end()); ++i) {
int cnt = mp[i];
if (cnt & 1) {
ans = i;
break;
}
mp[i + 1] += cnt / 2;
}
vector<int> p;
int id = find(a.begin(), a.end(), ans - 1) - a.begin();
if (id > 0) {
for (int i = 0; i < id; ++i)
p.push_back(a[i]);
p.push_back(ans);
for (int i = id; i < n; ++i)
p.push_back(a[i]);
}
else {
p.push_back(ans);
for (int i = 0; i < n; ++i)
p.push_back(a[i]);
}
for (auto& e : p)
cout << e << ' ';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
