#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 1e6 + 5;
struct Element {
int x, l, r;
bool operator<(Element other) const {
if(x == other.x) {
return l > other.l;
}
return x > other.x;
}
};
struct Ans {
int x, l, t;
bool operator<(Ans other) const {
if(l == other.l) {
return t < other.t;
}
return l < other.l;
}
};
int n, k;
priority_queue<Element> q;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
q.push((Element){a[i], i, i});
}
int total = k;
vector<Ans> ans;
int tim = 0;
while(1) {
if(q.top().x == 30) break;
int mn = q.top().x;
pair<int,int> le = make_pair(q.top().l, q.top().r);
q.pop();
if(mn == q.top().x && le.second == q.top().l - 1) {
auto val = (Element){mn + 1, le.first, q.top().r};
q.pop();
q.push(val);
}
else {
ans.push_back((Ans){mn, le.second + 1, tim++});
total--;
q.push((Element){mn + 1, le.first, le.second});
}
}
sort(ans.begin(), ans.end());
int ptr = 0;
for(int i = 0; i <= n; i++) {
if(ptr < (int)ans.size()) {
int end = ptr;
// Reverse the stack to process in correct order
while(end < (int)ans.size() && ans[end].l == i) {
end++;
}
stack<int> s;
for(int j = end - 1; j >= ptr; j--) {
s.push(ans[j].x);
}
ptr = end;
while(s.size()) {
while(total > 0 && s.top() > 0) {
total--;
int x = s.top();
s.pop();
s.push(x - 1);
s.push(x - 1);
}
cout << s.top() << " ";
s.pop();
}
}
if(i != n) cout << a[i] << " ";
}
return 0;
}
