#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
#include<map>
#define N 400000
#define inf 4e17
#define INF 2e23
#define Inf 1e9
using namespace std;
long long read()
{
    char c=0;
    long long sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
struct reads
{
    int l,r,c;
};
reads dque[N+1];
int n,k,top,tong[N+1],length,st[N+1],leng,lg[N+1],L[N+1],R[N+1];
long long sL,a[N+1],s[N+1];
__int128 ans=INF,dp[N+1],DP[N+1];
map<int,__int128>P[N+1];
vector<int>sts;
__int128 F(int l,int r)
{
    if (l>r) return INF;
    return (s[r]-s[(l+r)>>1])-(s[(l+r-1)>>1]-s[l-1]);
}
__int128 solve(long long d)
{
    int x;
    for (int i=1;i<=n;++i) dp[i]=INF;
    dque[top=1]=(reads){0,n,0};
    for (int i=1;i<=n;++i)
    {
	x=0;
	for (int j=lg[top];j>=0;--j)
	    if (x+(1<<j)<=top&&dque[x+(1<<j)].l<=i)
		x+=(1<<j);
	dp[i]=dp[dque[x].c]+F(dque[x].c+1,i)+d,R[i]=R[dque[x].c]+1;
	while (top&&dp[i]+F(i+1,dque[top].l)<=dp[dque[top].c]+F(dque[top].c+1,dque[top].l)) top--;
	if (top&&dp[i]+F(i+1,dque[top].r)<=dp[dque[top].c]+F(dque[top].c+1,dque[top].r))
	{
	    x=dque[top].r;
	    for (int j=lg[n];j>=0;--j)
		if (x-(1<<j)>=dque[top].l&&dp[i]+F(i+1,x-(1<<j))<=dp[dque[top].c]+F(dque[top].c+1,x-(1<<j)))
		    x-=(1<<j);
	    dque[top].r=x-1;
	}
	if (dque[top].r+1<=n) dque[top+1]=(reads){dque[top].r+1,n,i},++top;
    }
    return R[n];
}
void solve2(long long d)
{
    int x,cnt=0;
    for (int i=1;i<=n;++i) dp[i]=INF;
    dque[top=1]=(reads){0,n,0};
    for (int i=1;i<=n;++i)
    {
	x=0;
	for (int j=lg[top];j>=0;--j)
	    if (x+(1<<j)<=top&&dque[x+(1<<j)].l<=i)
		x+=(1<<j);
	dp[i]=dp[dque[x].c]+F(dque[x].c+1,i)+d,L[i]=L[dque[x].c]+1;
	while (top&&dp[i]+F(i+1,dque[top].l)<dp[dque[top].c]+F(dque[top].c+1,dque[top].l)) top--;
	if (top&&dp[i]+F(i+1,dque[top].r)<dp[dque[top].c]+F(dque[top].c+1,dque[top].r))
	{
	    x=dque[top].r;
	    for (int j=lg[n];j>=0;--j)
		if (x-(1<<j)>=dque[top].l&&dp[i]+F(i+1,x-(1<<j))<dp[dque[top].c]+F(dque[top].c+1,x-(1<<j)))
		    x-=(1<<j);
	    dque[top].r=x-1;
	}
	if (dque[top].r+1<=n) dque[top+1]=(reads){dque[top].r+1,n,i},++top;
    }
    x=n,tong[++length]=n;
    for (int i=n;i>=1;--i)
	if (dp[i-1]+F(i,x)+d==dp[x]&&L[i-1]<=k-cnt-1)
	    x=i-1,tong[++length]=i-1,cnt++;
    reverse(tong+1,tong+length+1);
    return;
}
void solve3(int l,int r,int l2,int r2)
{
    int mid=(l+r)>>1,ps=0;
    __int128 minn=inf;
    for (int i=l2;i<=min(mid-1,r2);++i)
	if (dp[i]+F(i+1,mid)<minn)
	    minn=dp[i]+F(i+1,mid),ps=i;
    if (l==r)
    {
	DP[l]=minn;
	return;
    }
    solve3(l,mid,l2,ps),solve3(mid+1,r,ps,r2);
    return;
}
vector<int>solve4(int ps,vector<int>sl,vector<int>sr)
{
    int x;
    vector<int>p;
    for (int i=1;i<=k;++i) P[i].clear();
    for (int i=sl[0];i<=sr[0];++i) dp[i]=inf;
    dp[ps]=0,dque[top=1]=(reads){ps,ps+n,ps};
    for (int i=sl[0];i<=sr[0];++i) P[0][i]=dp[i];
    for (int i=1;i<=k;++i)
    {
	for (int j=sl[i];j<=sr[i];++j) DP[j]=inf;
	solve3(sl[i],sr[i],sl[i-1],sr[i-1]);
	for (int j=sl[i];j<=sr[i];++j) P[i][j]=dp[j]=DP[j];
    }
    ps+=n,p.push_back(ps),x=ps;
    for (int i=k-1;i>=0;--i)
    {
	for (int j=sr[i];j>=sl[i];--j)
	    if (P[i][j]+F(j+1,x)==P[i+1][x])
	    {
		x=j;
		break;
	    }
	p.push_back(x);
    }
    reverse(p.begin(),p.end());
    return p;
}
void solve5(int l,int r,vector<int>sl,vector<int>sr)
{
    if (l==r)
    {
	vector<int>p=solve4(l,sl,sr);
	if (dp[l+n]<ans) ans=dp[l+n],sts=p;
	return;
    }
    int mid=(l+r)>>1;
    vector<int>p=solve4(mid,sl,sr);
    solve5(l,mid,sl,p),solve5(mid+1,r,p,sr);
    return;
}
int main()
{
    //freopen("cir.in","r",stdin);
    //freopen("cir.out","w",stdout);
    vector<int>sl;
    vector<int>sr;
    vector<long long>tans;
    int rt=0,l=0,r=0,rst=Inf;
    long long x=0;
    __int128 minn=INF;
    for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
    n=read(),k=read(),sL=read();
    for (int i=1;i<=n;++i) a[i]=read(),a[i+n]=a[i]+sL;
    for (int i=1;i<=(n<<1);++i) s[i]=s[i-1]+a[i];
    if (k==1)
    {
	for (int i=1;i<=n;++i)
	    if (F(i,i+n-1)<minn)
		minn=F(i,i+n-1),rt=i;
	printf("%lld\n%lld\n",(long long)(minn),a[(rt+rt+n-1)>>1]%sL);
	return 0;
    }
    for (int i=log(inf)/log(2);i>=0;--i)
	if (x+(1ll<<i)<=inf&&solve(x+(1ll<<i))>=k)
	    x+=(1ll<<i);
    solve2(x);
    for (int i=2;i<=length;++i)
	if (tong[i]-tong[i-1]<rst)
	    rt=i-1,l=tong[i-1],r=tong[i],rst=tong[i]-tong[i-1];
    for (int i=rt;i<=length;++i) st[++leng]=tong[i];
    for (int i=2;i<=rt;++i) st[++leng]=tong[i]+n;
    for (int i=1;i<=leng;++i)
    {
	sl.push_back(st[i]);
	if (i!=leng) sr.push_back(st[i+1]);
	else sr.push_back(n<<1);
    }
    solve5(l,r,sl,sr),printf("%lld\n",(long long)(ans));
    for (int i=0;i+1<sts.size();++i) tans.push_back(a[(sts[i]+sts[i+1]+1)>>1]%sL);
    sort(tans.begin(),tans.end());
    for (int i=0;i<tans.size();++i) printf("%lld ",tans[i]);
    puts("");
    return 0;
}