#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=4e5+5,inf=1e18;
struct msg1{
	int sm,sl;
	friend bool operator<(msg1 a,msg1 b){
		if(a.sm==b.sm)return a.sl>b.sl;
		return a.sm<b.sm;
	}
};
struct msg2{
	int sm,sl;
	friend bool operator<(msg2 a,msg2 b){
		if(a.sm==b.sm)return a.sl<b.sl;
		return a.sm<b.sm;
	}
};
int n,k,L,ni,p[N],qz[N],nw,mk[N],g1[N],g2[N],dp[N],ds[N],ans,res=inf;
unordered_map<int,int>dy[N];
msg1 f1[N];msg2 f2[N];
int gets(int l,int r){
	int mid=l+r>>1;
	return qz[r]-qz[mid]-p[mid]*(r-mid)+p[mid]*(mid-l+1)-(qz[mid]-qz[l-1]);
}
msg1 gets1(int l,int r){
	return {f1[l-1].sm+gets(l,r)-nw,f1[l-1].sl+1};
}
msg2 gets2(int l,int r){
	return {f2[l-1].sm+gets(l,r)-nw,f2[l-1].sl+1};
}
struct node{
	int l,r,bh;
};
bool chk(int x){
	nw=x;
	deque<node>q1,q2; 
	for(int i=1;i<=n;i++){
		while(q1.size()&&gets1(i,q1.back().l)<gets1(q1.back().bh,q1.back().l))q1.pop_back();
		if(q1.size()&&gets1(i,q1.back().r)<gets1(q1.back().bh,q1.back().r)){
			int l=q1.back().l,r=q1.back().r;
			while(l<r){
				int mid=l+r+1>>1;
				if(gets1(q1.back().bh,mid)<gets1(i,mid))l=mid;
				else r=mid-1;
			}
			q1.back().r=l;
		}
		if(q1.size()){
			if(q1.back().r<n)q1.push_back({q1.back().r+1,n,i});
		}else q1.push_back({i,n,i});
		while(q1.front().r<i)q1.pop_front();
		f1[i]=gets1(q1.front().bh,i);
		while(q2.size()&&gets2(i,q2.back().l)<gets2(q2.back().bh,q2.back().l))q2.pop_back();
		if(q2.size()&&gets2(i,q2.back().r)<gets2(q2.back().bh,q2.back().r)){
			int l=q2.back().l,r=q2.back().r;
			while(l<r){
				int mid=l+r+1>>1;
				if(gets2(q2.back().bh,mid)<gets2(i,mid))l=mid;
				else r=mid-1;
			}
			q2.back().r=l;
		}
		if(q2.size()){
			if(q2.back().r<n)q2.push_back({q2.back().r+1,n,i});
		}else q2.push_back({i,n,i});
		while(q2.front().r<i)q2.pop_front();
		f2[i]=gets2(q2.front().bh,i);
		g1[i]=f1[i].sl;g2[i]=f2[i].sl;
	}
	return g1[n]>=k;
}
vector<pair<int,int> >jl;
void creat(){
	int nw=n,nk=k;
	while(nw){
		mk[nw]=1;
		for(int i=nw;i>=1;i--){
			if(f1[i-1].sm+gets(i,nw)-ans!=f1[nw].sm)continue;
			if(nk-1<g2[i-1]||nk-1>g1[i-1])continue;
			jl.push_back({i-1,nw});
			nw=i-1;
			nk--;
			break;
		}
	}
}
void solve(int l,int r,int a,int b){
	if(l>r)return;
	int mid=l+r>>1,wz,ans=inf;
	for(int i=a;i<=b;i++){
		if(ds[i]+gets(i+1,mid)<ans){
			ans=ds[i]+gets(i+1,mid);
			wz=i;
		}
	}
	dy[ni][mid]=wz;
	dp[mid]=ans;
	solve(l,mid-1,a,wz);
	solve(mid+1,r,wz,b);
}
vector<int>rr;
void solve(int l,int r,vector<pair<int,int> >q){
	if(l>r)return;
	int mid=l+r>>1;
	for(int i=q[0].first;i<=q[0].second;i++)dp[i]=inf;
	dp[mid]=0;
//	cout<<mid<<endl; 
	for(int i=1;i<q.size();i++){
		ni=i;
		for(int j=q[i-1].first;j<=q[i-1].second;j++)ds[j]=dp[j];
		solve(q[i].first,q[i].second,q[i-1].first,q[i-1].second);
	}
	int wz=0,sms=inf;
	//for(int i=1;i<=n;i++)cout<<i<<" "<<dp[i]<<" "<<dy[i]<<endl;
	for(int i=q.back().first;i<=q.back().second;i++){
		if(dp[i]+gets(i+1,mid+n)<sms){
			sms=dp[i]+gets(i+1,mid+n);
			wz=i;
		}
	}
	vector<int>jl;
	int nw=wz,nk=k-1;
//	for(auto c:q)cout<<c.first<<" "<<c.second<<endl;
   // for(int i=1;i<=n;i++)cout<<i<<" "<<dp[i]<<" "<<dy[i]<<endl;
	while(nw!=mid){
		jl.push_back(nw);
		nw=dy[nk][nw];
		nk--;
	}
	vector<pair<int,int> >q1,q2;
	q1.push_back({l,mid-1});
	q2.push_back({mid+1,r});
    reverse(jl.begin(),jl.end());
    for(int i=1;i<q.size();i++){
    	q1.push_back({q[i].first,jl[i-1]});
    	q2.push_back({jl[i-1],q[i].second});
	}
	if(sms<res){
		res=sms;
		rr.clear();
		rr.push_back(p[mid+jl[0]+1>>1]);
		for(int i=1;i<jl.size();i++)rr.push_back(p[jl[i-1]+jl[i]+1>>1]);
		rr.push_back(p[mid+n+jl.back()+1>>1]);
	}
	solve(l,mid-1,q1);solve(mid+1,r,q2);
}
signed main(){
//	freopen("in.txt","r",stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>k>>L;
	for(int i=1;i<=n;i++)cin>>p[i],p[i+n]=p[i]+L;
	for(int i=1;i<=2*n;i++)qz[i]=qz[i-1]+p[i];
	if(k==1){
		int wz=0;
		for(int i=1;i<=n;i++){
			if(gets(i,i+n-1)<res){
				res=gets(i,i+n-1);
				wz=p[2*i+n-1>>1];
			}
		}
		if(wz>=L)wz-=L;
		cout<<res<<endl<<wz;
		return 0;
	}
	int l=-n*L,r=n*L;
	while(l<r){
		int mid=l+r>>1;
		if(chk(mid))r=mid;
		else l=mid+1; 
	}
	ans=l;
	chk(ans);
	creat();
	reverse(jl.begin(),jl.end());
//	for(auto c:jl)cout<<c.first<<" "<<c.second<<endl;
	int tmp,wz;
	for(int i=0;i<jl.size();i++){
		auto c=jl[i];
		if(c.second-c.first<=n/k+1){
			wz=i;
			tmp=c.first;
			break;
		}
	}
//	cout<<tmp<<endl;
    rotate(p+1,p+tmp+1,p+n+1);
    for(int i=n-tmp+1;i<=n;i++)p[i]+=L;
	for(int i=1;i<=n;i++)p[i+n]=p[i]+L;
//	for(int i=1;i<=n;i++)cout<<p[i]<<" ";
//	cout<<endl;
	for(int i=1;i<=2*n;i++)qz[i]=qz[i-1]+p[i];
//	for(auto c:jl)cout<<c.first<<" "<<c.second<<endl;
	for(int i=0;i<jl.size();i++){
		auto &c=jl[i];
		c.first=(c.first-tmp+n)%n;
		c.second=(c.second-tmp+n)%n;
		if(i!=wz&&c.second==0)c.second=n;
	}
//	for(auto c:jl)cout<<c.first<<" "<<c.second<<endl;
	sort(jl.begin(),jl.end());
	solve(jl[0].first,jl[0].second,jl);
	cout<<res<<endl;
	for(auto &c:rr)c%=L;
	sort(rr.begin(),rr.end());
	cerr<<res<<endl;
	for(auto c:rr)cout<<c<<" "; 
}