#include <bits/stdc++.h>

#define fi first
#define se second

using namespace std;

typedef long long LL;
typedef __int128 i128;

const int N = 4e5 + 5;
const LL INF = 0x3f3f3f3f3f3f3f3f;

int n, k;
LL l, a[N], sa[N];

i128 f[N];
int c0[N], c1[N];
int p[N], rp[N];
LL ans;

struct Range{
    int l, r, k;
}q[N];
int hh, tt;

inline i128 W(int i, int j)
{
	int mid = (i + j + 1) >> 1;
	return i == j ? INF : f[i] + (sa[j] - sa[mid]) - (sa[mid] - sa[i]) + a[mid] * ((mid - i) - (j - mid));
}
inline bool Solve(LL d, int c[])
{
    q[hh = tt = 0] = {1, n, 0};
    for(int i = 1; i <= n; i ++ )
    {
        f[i] = W(q[hh].k, i) - d;
        c[i] = c[q[hh].k] + 1;
        q[hh].l ++ ;
        if(q[hh].l > q[hh].r) hh ++ ;
        while(hh <= tt && W(i, q[tt].l) < W(q[tt].k, q[tt].l)) tt -- ;
        if(hh > tt) q[hh = tt = 0] = {i + 1, n, i};
        else
        {
            int L = q[tt].l, R = q[tt].r + 1, Mid;
            while(L < R)
            {
                Mid = (L + R) >> 1;
                if(W(i, Mid) < W(q[tt].k, Mid)) R = Mid;
                else L = Mid + 1;
            }
            q[tt].r = L - 1;
            if(L <= n) q[ ++ tt] = {L, n, i};
        }
    }
    return c[n] <= k;
}
inline void Get()
{
	LL L = -2e17, R = 0, Mid;
	while(L < R)
	{
		Mid = (L + R + 1) >> 1;
		if(Solve(Mid, c0)) L = Mid;
		else R = Mid - 1;
	}
	Solve(L + 1, c1);
	Solve(L, c0);
	ans = f[n] + (i128)L * k;
	p[k] = n;
	for(int i = n - 1, j = n, t = k - 1; i >= 0; i -- )
	{
		if(c0[i] <= t && t <= c1[i] && W(i, j) - L == f[j])
		{
			j = p[t -- ] = i;
		}
	}
}

LL g[N];
int pre[N];
vector<int> pp[N];

inline void Solve(int l, int r, int L, int R)
{
	if(l > r) return ;
	if(L == R)
	{
		for(int i = l; i <= r; i ++ )
		{
			g[i] = W(L, i);
			pre[i] = L;
		}
		return ;
	}
	int mid = (l + r) >> 1, p = L;
	i128 w = INF;
	for(int i = L; i <= R; i ++ )
	{
		if(W(i, mid) < w)
		{
			w = W(i, mid);
			p = i;
		}
	}
	g[mid] = w, pre[mid] = p;
	Solve(l, mid - 1, L, p);
	Solve(mid + 1, r, p, R);
}
inline void Solve(vector<pair<int, int> > p)
{
	if(p[0].fi > p[0].se) return ;
	int l = p[0].fi, r = p[0].se, mid = (l + r) >> 1;
	p[0].fi = p[0].se = mid;
	p.emplace_back(mid + n, mid + n);
//	for(int i = 0; i <= k; i ++ ) printf("(%d %d) ", p[i].fi, p[i].se);
//	puts("");
	f[mid] = 0;
	for(int i = 1; i <= k; i ++ )
	{
		Solve(p[i].fi, p[i].se, p[i - 1].fi, p[i - 1].se);
		for(int j = p[i].fi; j <= p[i].se; j ++ ) f[j] = g[j];
		pp[i] = vector<int>(pre + p[i].fi, pre + p[i].se + 1);
	}
	p[0] = {l, r}, p[k] = {l + n, r + n};
	vector<pair<int, int> > p1(p);
	p1.pop_back();
	for(int i = k - 1, j = pre[mid + n]; i >= 0; j = i ? pp[i][j - p[i].fi] : 0, i -- )
	{
		p1[i].fi = p[i].fi;
		p1[i].se = j;
	}
	if(f[mid + n] < ans)
	{
		ans = f[mid + n];
		for(int i = 0; i < k; i ++ ) rp[i] = p1[i].se;
		rp[k] = mid + n;
	}
//	for(int i = 0; i < k; i ++ ) printf("%d ", p1[i].se);
//	puts("");
	assert(p1[0].se == mid);
	p1[0].se -- ;
	Solve(p1);
	for(int i = 0; i < k; i ++ )
	{
		p1[i].fi = p1[i].se;
		p1[i].se = p[i].se;
	}
	p1[0].fi += 2;
	Solve(p1);
}

LL rr[N];

int main()
{
	scanf("%d%d%lld", &n, &k, &l);
	for(int i = 1; i <= n; i ++ ) scanf("%lld", &a[i]), a[n + i] = a[i] + l;
	for(int i = 1; i <= n * 2; i ++ ) sa[i] = sa[i - 1] + a[i];
	Get();
	for(int i = 0; i <= k; i ++ ) rp[i] = p[i], p[i + k] = p[i] + n;
//	printf("!%lld\n", ans);
//	for(int i = 0; i <= k; i ++ ) printf("%d ", p[i]);
//	puts("");
	int t = 0;
	for(int i = 1; i < k; i ++ )
		if(p[i + 1] - p[i] < p[t + 1] - p[t])
			t = i;
	vector<pair<int, int> > p1;
	for(int i = 0; i < k; i ++ ) p1.emplace_back(p[i + t], p[i + t + 1]);
	Solve(p1);
	printf("%lld\n", ans);
	for(int i = 0; i < k; i ++ ) rr[i] = a[(rp[i] + rp[i + 1] + 1) >> 1] % l;
	sort(rr, rr + k);
	for(int i = 0; i < k; i ++ ) printf("%lld ", rr[i]);
	puts("");
	return 0;
}