#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
int N,K;
vpi seq;
int need;
vi ans;
void tri(int x) {
if (!need || x == 0) ans.pb(x);
else {
need --;
tri(x-1), tri(x-1);
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N >> K;
vi q;
F0R(i,N) {
int x; cin >> x;
while (sz(q) && x > q.back()) {
seq.pb({q.back(),1});
q.pb(q.back());
while (sz(q) > 1 && q.back() == q[sz(q)-2]) q.pop_back(), q.back() ++;
}
q.pb(x); seq.pb({x,0});
while (sz(q) > 1 && q.back() == q[sz(q)-2]) q.pop_back(), q.back() ++;
/*for (auto a: q) cout << a << " ";
cout << "\n";*/
}
while (q.back() != 30) {
seq.pb({q.back(),1});
q.pb(q.back());
while (sz(q) > 1 && q.back() == q[sz(q)-2]) q.pop_back(), q.back() ++;
}
need = N+K-sz(seq);
for (auto a: seq) {
if (a.s == 0) ans.pb(a.f);
else tri(a.f);
}
for (int i: ans) cout << i << " ";
}
/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/
