#include<bits/stdc++.h>
#define int long long
#define ls t[x].ch[0]
#define rs t[x].ch[1]
using namespace std;
typedef long long ll;
const int N=100000+5;
const ll inf=((1LL*1)<<62);
int n,k;
ll h[N];
ll ans;
int pos;
ll sum;
ll to;
struct node{int ch[2];ll sum,val;int sz,fa;int tot;void init(int f,ll v){fa=f,val=v;sum=v,sz=1,tot=1;}
}t[N];
int rt;
int pc;
void pushup(int x){t[x].sz=t[ls].sz+t[rs].sz+t[x].tot;t[x].sum=t[ls].sum+t[rs].sum+t[x].tot*t[x].val;
}
void rotate(int x){int y=t[x].fa,d=t[y].ch[1]==x;t[t[y].ch[d]=t[x].ch[!d]].fa=y;t[t[x].fa=t[y].fa].ch[t[t[y].fa].ch[1]==y]=x;t[t[x].ch[!d]=y].fa=x;pushup(y);
}
void splay(int x,int f){while(t[x].fa!=f){int y=t[x].fa,z=t[y].fa;if(z!=f) {rotate((t[y].ch[0]==x)==(t[z].ch[0]==y)?y:x);}rotate(x);}pushup(x);if(f==0) rt=x;
}
void insert(ll v){if(!rt){rt=++pc;t[rt].init(0,v);return;}int x=rt;while(1){//cout<<" x "<<rt<<endl;t[x].sum+=v;t[x].sz++;if(t[x].val==v){t[x].tot++;break;}int d=t[x].val<v;if(!t[x].ch[d]){t[x].ch[d]=++pc;t[t[x].ch[d]].init(x,v);x=t[x].ch[d];break;}x=t[x].ch[d];}splay(x,0);
}
void remove(int v){int goal=rt;while(t[goal].val!=v){int d=t[goal].val<v;goal=t[goal].ch[d];}splay(goal,0);t[goal].tot--;t[goal].sum-=v;t[goal].sz--;//pushup(goal);if(t[goal].tot) return;int son=t[goal].ch[1];while(son&&t[son].ch[0]) son=t[son].ch[0];if(!son){rt=t[goal].ch[0];t[rt].fa=0;}else{splay(son,goal);t[t[son].ch[0]=t[goal].ch[0]].fa=son;t[rt=son].fa=0;pushup(rt);}
}
int kth(int k){int u=rt;//cout<<" k , u"<<k<<" "<<u<<endl;while(1){int d=k-t[t[u].ch[0]].sz;//cout<<" d "<<d<<endl;if(d<=0) u=t[u].ch[0];else if(d>=1&&d<=t[u].tot) return u;else {k=d-t[u].tot;u=t[u].ch[1];}}
}
signed main(){//freopen("4.in","r",stdin);//freopen("haha.out","w",stdout);scanf("%lld%lld",&n,&k);for(int i=1;i<=n;i++) scanf("%lld",&h[i]);for(int i=1;i<=k;i++){//cout<<" before "<<i<<endl;insert(h[i]);sum+=h[i];}//cout<<" bug "<<endl;ans=inf;int hlf=(k+1)/2;//cout<<" hlf "<<hlf<<endl;
//    cout<<rt<<" "<<t[rt].ch[1]<<" "<<t[t[rt].ch[1]].ch[1]<<endl;for(int i=k;i<=n;i++){int now=kth(hlf);splay(now,0);//cout<<" now "<<now<<endl;int v=t[now].val;ll zong=t[t[now].ch[0]].sum+(hlf-t[t[now].ch[0]].sz)*v;ll cos=v*hlf-zong;cos+=sum-zong-(k-hlf)*v;//cout<<i<<" : "<< "cos "<<cos<<" zong "<<zong<<" v "<<v<<endl;if(cos<ans){ans=cos;pos=i;to=v;//cout<<" new "<<" i "<<i<<"  "<<ans<<" "<<v<<endl;
        }sum-=h[i-k+1];remove(h[i-k+1]);if(i+1<=n){sum+=h[i+1];insert(h[i+1]);}}//cout<<endl<<endl;printf("%lld\n",ans);for(int i=1;i<=n;i++){if(i>=pos-k+1&&i<=pos) printf("%lld\n",to);else printf("%lld\n",h[i]);}return 0;
}