#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int a[800005],qzh[800005];
int na[800005];
int zy[800005];
int dp[800005],sl[800005];
int n,k,len;
int findzy(int l,int r)
{
	assert(l<=r);
	int mid=((l+r+1)>>1);
	return dp[l]+na[mid]*(mid-l)-qzh[mid]+qzh[l]+qzh[r]-qzh[mid]-na[mid]*(r-mid);
}
bool bijiao(int x,int y,int r)
{
	int sth1=findzy(x,r),sth2=findzy(y,r);
	if(sth1<sth2)return true;
	if(sth1==sth2&&sl[x]<sl[y])return true;
	return false;
}
int gz[400005],cnt;
void findgz(int x)
{
	if(x==0)return;
	gz[++cnt]=x;
	findgz(zy[x]);
}
int gz1[400005],cnt1;
int gz2[400005],cnt2;
int que[800005],zl[800005],zr[800005],ql,qr;
int solve(int mid)
{
	dp[0]=0;
	sl[0]=0;
	ql=qr=1;
	que[1]=0;
	zl[1]=1;
	zr[1]=n;
	for(int i=1;i<=n;i++)
	{
		//printf("vis:%lld\n",i);
		if(i>zr[ql])ql++;
		if(ql<=qr&&i==zl[ql])zl[ql]++;
		int nh=findzy(que[ql],i)+mid;
		dp[i]=nh;
		sl[i]=sl[que[ql]]+1;
		zy[i]=que[ql];
		if(i==n)break;
		while(qr>=ql&&bijiao(i,que[qr],zl[qr]))qr--;
		if(qr<ql)
		{
			que[++qr]=i;
			zl[qr]=i+1;
			zr[qr]=n;
			continue;
		}
		int l=zl[qr],r=n,mid;
		while(l<=r)
		{
			mid=(l+r)>>1;
			if(bijiao(i,que[qr],mid))r=mid-1;
			else l=mid+1;
		}
		zr[qr]=r;
		if(l<=n)
		{
			que[++qr]=i;
			zl[qr]=l;
			zr[qr]=n;
		}
	}
	cnt=0;
	findgz(zy[n]);
	gz[++cnt]=n;
	return cnt;
}
int qans=1000000000000000000LL;
vector<int>sc;
int dy[800005];
int pos[800005];
int findzy2(int l,int r)
{
	int sth=dp[l];
	l=pos[l];
	if(l>=r)r+=n;
	int mid=((l+r+1)>>1);
	return sth+na[mid]*(mid-l)-qzh[mid]+qzh[l]+qzh[r]-qzh[mid]-na[mid]*(r-mid);
}
bool bijiao2(int x,int y,int r)
{
	int sth1=findzy2(x,r),sth2=findzy2(y,r);
	if(sth1<=sth2)return true;
	return false;
}
void fenzhi(int l,int r,vector<int> vl,vector<int> vr)
{
	if(l>r)return;
	//printf("???%lld %lld\n",l,r);
	//for(int i=0;i<vl.size();i++)printf("%lld %lld\n",vl[i],vr[i]);
	int mid=((l+r)>>1);
	ql=1;
	qr=1;
	que[1]=1;
	dp[1]=0;
	pos[1]=mid;
	zl[1]=vl[0]; 
	zr[1]=vr[0];
	int tmp=1,tl=0,tr=0;
	for(int i=0;i<vl.size();i++)
	{
		tl=tmp+1;
		for(int j=vl[i];j<=vr[i];j++)
		{
			if(zr[ql]<j)ql++;
			dp[++tmp]=findzy2(que[ql],j);
			pos[tmp]=j;
			//printf("%lld %lld %lld %lld\n",que[ql],tmp,pos[tmp],dp[tmp]);
			zy[tmp]=que[ql];
		}
		tr=tmp;
		if(i==vl.size()-1)break;
		ql=1;
		qr=1;
		int xj=vl[i+1],sj=vr[i+1];
		que[1]=tl;
		zl[1]=xj;
		zr[1]=sj;
		for(int j=tl+1;j<=tr;j++)
		{
			while(qr>=ql&&bijiao2(j,que[qr],zl[qr]))qr--;
			if(qr<ql)
			{
				que[++qr]=j;
				zl[qr]=xj;
				zr[qr]=sj;
				continue;
			}
			int l=zl[qr],r=sj,nmid;
			while(l<=r)
			{
				nmid=(l+r)>>1;
				if(bijiao2(j,que[qr],nmid))r=nmid-1;
				else l=nmid+1;
			}
			zr[qr]=r;
			if(l<=sj)
			{
				que[++qr]=j;
				zl[qr]=l;
				zr[qr]=sj;
			}
		}
		//for(int j=ql;j<=qr;j++)printf("%d %d %d\n",que[j],zl[j],zr[j]);
	}
	int minn=1000000000000000000LL,mpos=0;
	for(int i=tl;i<=tr;i++)
	{
		if(findzy2(i,mid)<minn)
		{
			minn=findzy2(i,mid);
			mpos=i;
		}
	}
	vector<int>sy;
	int sth=mpos;
	while(sth!=1)
	{
		assert(zy[sth]!=sth);
		sy.push_back(pos[sth]);
		sth=zy[sth];
	}
	reverse(sy.begin(),sy.end());
	if(minn<qans)
	{
		qans=minn;
		sc=sy;
		sc.push_back(mid);
	}
	fenzhi(l,mid-1,vl,sy);
	fenzhi(mid+1,r,sy,vr);
}
bool xz[200005];
signed main()
{
	n=read();
	k=read();
	len=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=n;i++)na[i]=a[i]-a[1];
	for(int i=1;i<=n;i++)na[i+n]=na[i]+len;
	for(int i=1;i<=2*n;i++)qzh[i]=qzh[i-1]+na[i];
	int l=0,r=n*len/k,mid;
	while(l<=r)
	{
		mid=((l+r)>>1);
		if(solve(mid)<=k)r=mid-1;
		else l=mid+1;
	}
	//printf("!!!\n");
	solve(r);
	cnt1=cnt;
	for(int i=1;i<=cnt1;i++)gz1[i]=gz[i];
	sort(gz1+1,gz1+cnt1+1);
	solve(l);
	cnt2=cnt; 
	for(int i=1;i<=cnt2;i++)gz2[i]=gz[i];
	sort(gz2+1,gz2+cnt2+1);
	if(cnt2==k)
	{
		cnt=k;
		for(int i=1;i<=cnt;i++)gz[i]=gz2[i];
	}
	else
	{
		int gb=k-cnt2;
		if(cnt2>=k||cnt1<=k)
		{
			printf("no\n");
			return 0;
		}
		bool flag=false;
		for(int i=1;i<=cnt2;i++)
		{
			if(gz2[i]<=gz1[i+gb]&&gz2[i+1]>=gz1[i+1+gb])
			{
				cnt=0;
				for(int j=1;j<=i+gb;j++)gz[++cnt]=gz1[j];
				for(int j=i+1;j<=cnt2;j++)gz[++cnt]=gz2[j];
				flag=true;
				break;
			}
		}
		assert(flag);
	}
	sort(gz+1,gz+cnt+1);
	/*printf("%d\n",cnt);
	for(int i=1;i<=cnt;i++)printf("%d ",gz[i]);
	printf("\n");
	printf("%d\n",cnt1);
	for(int i=1;i<=cnt1;i++)printf("%d ",gz1[i]);
	printf("\n");
	printf("%d\n",cnt2);
	for(int i=1;i<=cnt2;i++)printf("%d ",gz2[i]);
	printf("\n");*/
	//return 0;
	int minn=n+1,mpos=0;
	for(int i=0;i<=cnt-1;i++)
	{
		if(gz[i+1]-gz[i]<minn)
		{
			minn=gz[i+1]-gz[i];
			mpos=i;
		}
	}
	//printf("%d\n",mpos);
	int nl=max(gz[mpos],1LL),nr=gz[mpos+1];
	vector<int>vl,vr;
	for(int i=(mpos+1)%cnt;i!=mpos;i=(i+1)%cnt)
	{
		vl.push_back(max(1LL,gz[i]));
		vr.push_back(gz[i+1]);
	}
	//printf("orz\n");
	//printf("%lld %lld\n",nl,nr);
	//for(int i=0;i<vl.size();i++)printf("%lld %lld\n",vl[i],vr[i]);
	//printf("\n");
	fenzhi(nl,nr,vl,vr);
	printf("%lld\n",qans);
	sort(sc.begin(),sc.end());
	for(int i=0;i+1<sc.size();i++)
	{
		//printf("%lld %lld\n",sc[i],sc[i+1]);
		xz[(sc[i]+sc[i+1]+1)/2]=true;
	}
	int sth=(sc[sc.size()-1]+sc[0]+n+1)/2;
	xz[(sth-1)%n+1]=true;
	for(int i=1;i<=n;i++)if(xz[i])printf("%lld ",a[i]);
	return 0;
}