#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
#define int LL
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline LL read(){
	char ch=getchar(); LL w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}
const int M=7.5e5+10; 
int n,m;
LL L,a[M],s[M];
LL calc(int l,int r){
//	cerr<<l<<" "<<r<<"\n";
	assert(r<=3*n);
	if (l>=r) return 0;
	int mid=(l+r>>1);
//	assert((mid-l+1)*a[mid]-(s[mid]-s[l-1])+(s[r]-s[mid])-(r-mid)*a[mid]>=0);
	return (mid-l+1)*a[mid]-(s[mid]-s[l-1])+(s[r]-s[mid])-(r-mid)*a[mid];
}
int q[M],qk[M],len[M],pre[M];
LL dp[M];
int O;
int cmp(int x,int y){
	int l=y+1,r=n,ret=l-1;
	while (l<=r){
		int mid=(l+r>>1);
//		O++;
		if (mp(dp[x]+calc(x+1,mid),len[x])<mp(dp[y]+calc(y+1,mid),len[y])) ret=mid,l=mid+1;
		else r=mid-1;
	}
	return ret;
}
void work1(LL k){
	dp[1]=0;
//	cerr<<k<<"   erfen \n"; 
	q[1]=1; qk[1]=n;
	int l=1,r=1;
	F(i,2,n){
		while (l<=r && qk[l]<i) l++;
		dp[i]=dp[q[l]]+calc(q[l]+1,i)+k;
//		cerr<<q[l]<<" "<<i<<" "<<dp[i]<<" "<<qk[l]<<" "<<l<<" "<<r<<" ???\n";
		pre[i]=q[l];
		len[i]=len[q[l]]+1;
		int la=n;
		while (l<r && (la=cmp(q[r],i))<=qk[r-1]) r--;
		qk[r]=(l==r ? cmp(q[r],i) : la);
		q[++r]=i; qk[r]=n;
	}
}
vector<int> getp(){
	LL l=0,r=n*L/m,ret=r;
	while (l<=r){
		LL mid=(l+r>>1);
//		O=0;
		work1(mid);
//		cerr<<O<<"\n";
		if (len[n]<=m) ret=mid,r=mid-1;
		else l=mid+1;  
	}
	work1(ret);
	vector<int> A; int tmp=n; while (tmp) A.pb(tmp),tmp=pre[tmp];
	reverse(A.begin(),A.end());
//	cerr<<A.size()<<"\n";
	if (A.size()==m+1) return A;
	work1(ret-1);
	vector<int> B; tmp=n; while (tmp) B.pb(tmp),tmp=pre[tmp];
	reverse(B.begin(),B.end());
	int del=m-A.size()+1;
//	cerr<<A.size()<<" "<<B.size()<<" ???\n";
	F(i,0,SZ(A)-1){
		if (A[i]<=B[i+del] && B[i+del+1]<=A[i+1]){
			vector<int> ret;
			F(j,0,i+del) ret.pb(B[j]);
			F(j,i+1,SZ(A)) ret.pb(A[j]); 
			assert(ret.size()==m+1);
			return ret;		
		}
	}
	assert(0);
}
LL ans=1e18;
vector<int> rec;
LL f[M];
void dnc(int id,int l,int r,int ll,int rr){
	if (l>r || ll>rr) return ;
	int mid=(ll+rr>>1),bm=l;
	f[id+1+mid]=1e18;
	F(i,l,r){
		if (f[id+i]+calc(i+1,mid)<f[id+1+mid]) f[id+1+mid]=f[id+i]+calc(i+1,mid),pre[id+1+mid]=id+i,bm=i;
	}
	dnc(id,l,bm,ll,mid-1);
	dnc(id,bm,r,mid+1,rr);
}
void solve(vector<int> ql,vector<int> qr){
	if (ql[0]>qr[0]) return ;
//	cerr<<ql[0]<<" "<<qr[0]<<"\n";
	vector<int> mid; mid.resize(m);
	mid[0]=(ql[0]+qr[0]>>1);
	LL cur=0;
	if (m==1){
		cur=calc(mid[0],mid[0]+n-1);
	}
	else{
		
		F(i,ql[1],qr[1]){
			pre[i+1]=mid[0];
			f[i+1]=calc(mid[0]+1,i);
		}
		F(i,1,m-2)
			dnc(i,ql[i],qr[i],ql[i+1],qr[i+1]);	
		cur=1e18;
		int bp=ql[m-1];
		F(i,ql[m-1],qr[m-1]){
			if (f[m-1+i]+calc(i+1,mid[0]+n)<=cur){
				cur=f[m-1+i]+calc(i+1,mid[0]+n);
				bp=i+m-1;
			}
		}
		DF(i,m-1,1) mid[i]=bp-i,bp=pre[bp]; 
	}
	if (cur<=ans){
		ans=cur;
		rec=mid;
	}
	mid[0]-=1;
	solve(ql,mid);
	mid[0]+=2;
	solve(mid,qr);
}
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
	n=read(); m=read();  L=read();
//	n=200000; m=10; L=1e12;
	F(i,1,n) a[i]=read();
//	F(i,1,n) a[i]=rnd()%L;
//	sort(a+1,a+n+1);
//	
	F(i,1,n) a[i+n]=a[i]+L; 
	F(i,1,n) a[i+n+n]=a[i+n]+L;
	F(i,1,3*n) s[i]=s[i-1]+a[i];
//	F(i,1,n){
//		F(j,i+1,n){
//			cerr<<calc(i,j)<<" ";
//		}
//		cerr<<'\n';
//	}
	vector<int> div=getp();
	div.pop_back();
	F(i,0,m-1) div.pb(div[i]+n);
//	return 0;
	int mi=1e9,id=-1;
	F(i,0,m-1){
		if (div[i+1]-div[i]<mi){
			mi=div[i+1]-div[i];
			id=i;
		}
	}
	vector<int> ql,qr; ql.resize(m);qr.resize(m);
	F(i,1,m){
		ql[i-1]=div[i+id-1]; qr[i-1]=div[i+id];
	}
	solve(ql,qr);
	cout<<ans<<"\n";
	rec.pb(rec[0]+n);
	vector<LL> as;
	F(i,0,m-1){
		as.pb(a[(rec[i]+rec[i+1]+1>>1)]%L);
	}
	sort(as.begin(),as.end());
	for (int x:as) cout<<x<<" ";
	cout<<"\n"; 
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/