#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m;
ll L,X[601010],su[400110],dp[601000];
const ll I=1e18;
struct qq{int l,r,i;}q[200110];
int lp,rp,ii;
ll co(int i,int j){
    if(i>=j)j+=n;
    int o=(j-i)/2;
    return (su[j]-su[j-o])-(su[i+o]-su[i]);
}
int c[201000][2];
bool chk(int i1,int i2,int x,int t){
    ll v1=dp[i1]+co(i1,x),v2=dp[i2]+co(i2,x);
    if(v1!=v2)return v1>v2;
    if(t)return c[i1][t]<c[i2][t];
    return c[i1][t]>c[i2][t];
}
int Sol(ll v,int t){
    q[lp=rp=1]=(qq){1,n,0};
    dp[0]=0;
    for(int i=1;i<=n;i++){
        qq e=q[lp];
        dp[i]=dp[e.i]+co(e.i,i)+v;
        c[i][t]=c[e.i][t]+1;
        if(q[lp].l<q[lp].r)q[lp].l++;
        else lp++;
        while(lp<=rp&&chk(q[rp].i,i,q[rp].l,t))rp--;
        if(lp>rp)q[++rp]=(qq){i+1,n,i};
        else{
            int l=q[rp].l+1,r=q[rp].r,z=r+1;
            while(l<=r){
                int mid=(l+r)>>1;
                if(chk(q[rp].i,i,mid,t))z=mid,r=mid-1;
                else l=mid+1;
            }
            q[rp].r=z-1;
            if(z<=n)q[++rp]=(qq){z,n,i};
        }
    }
    return c[n][1];
}
ll at;
void sl(){
    ll l=0,r=L*n;
    while(l<=r){
        ll mid=(l+r)>>1;
        int op=Sol(mid,1);
        if(op>=m)at=mid,l=mid+1;
        else r=mid-1;
    }
    Sol(at,1),Sol(at,0);
}
int vl[200100],vr[200010],tl[201000],tr[200100];
int rt[601000];
void print(){
    int j=m,pi=n;
    vector<int>P;P.push_back(n);
    for(int i=n-1;i>=0;i--)if(c[i][0]+1<=j&&j<=c[i][1]+1&&dp[i]+co(i,pi)+at==dp[pi])P.push_back(i),pi=i,j--;
    reverse(P.begin(),P.end());
    for(int i=0;i<m;i++)vl[i]=P[i],vr[i]=P[i+1];
}
int nb[600100];
int af[601000];ll ans;
int Z[600100];
void cdq(int pl,int pr,int l,int r){
    if(l>r)return;
    int mid=(l+r)>>1,ik=-1;
    int og=Z[ii]+mid;
    dp[og]=I*3;
    for(int i=pl;i<=pr;i++)if(dp[og]>dp[Z[ii-1]+i]+co(i,mid))dp[og]=dp[Z[ii-1]+i]+co(i,mid),ik=i;
    rt[og]=ik;
    cdq(pl,ik,l,mid-1),cdq(ik,pr,mid+1,r);
}
void gh(int h){
    vl[0]=vr[0]=vl[m]=vr[m]=h,Z[0]=1;
    for(int i=1;i<=m;i++)Z[i]=Z[i-1]+vr[i]-vl[i]+1;
    for(int i=0;i<=m;i++)Z[i]-=(vr[i]-vl[i]+1),Z[i]-=vl[i];
    dp[0]=0;
    for(ii=1;ii<=m;ii++)
        cdq(vl[ii-1],vr[ii-1],vl[ii],vr[ii]);
    int u=h;
    for(int i=m-1;i;i--)nb[i]=rt[Z[i+1]+u],u=nb[i];
    nb[0]=h;
    if(ans>dp[Z[m]+h]){
        ans=dp[Z[m]+h];
        for(int i=0;i<m;i++)af[i]=nb[i];
    }
}
void sol(int l,int r){
    if(l>r)return;
    int h=(l+r)>>1;
    gh(h);
    vector<int>ff,fn;ff.push_back(0),fn.push_back(0);
    for(int i=1;i<m;i++)fn.push_back(nb[i]),ff.push_back(vr[i]),vr[i]=fn[i];
    sol(l,h-1);
    for(int i=1;i<m;i++)vr[i]=ff[i],ff[i]=vl[i],vl[i]=fn[i];
    sol(h+1,r);
}
bool vi[601000];
void gx(int l,int r){
    if(l>r)r+=n;
    int Z=(l+r+1)/2;
    vi[(Z+n-1)%n+1]=1;
}
int main(){
	scanf("%d%d%lld",&n,&m,&L);
	for(int i=1;i<=n;i++)scanf("%lld",&X[i]),X[i+n]=L+X[i];
    for(int i=1;i<=n*2;i++)su[i]=su[i-1]+X[i];
    sl();print();int ip=-1,mi=n+1;
    for(int i=0;i<m;i++)mi=min(mi,vr[i]-vl[i]);
    for(int i=0;i<m;i++)if(mi==vr[i]-vl[i])ip=i;
    for(int i=0;i<m;i++)tl[i]=vl[(i+ip)%m],tr[i]=vr[(i+ip)%m];
    for(int i=0;i<m;i++)swap(tl[i],vl[i]),swap(tr[i],vr[i]);
    ans=I*3,sol(vl[0],vr[0]);
    for(int i=0;i<m;i++)gx(af[i],af[(i+1)%m]);
    printf("%lld\n",ans);
    for(int i=1;i<=n;i++)if(vi[i])printf("%lld ",X[i]);
	return 0;
}