//路径交错
#include <bits/stdc++.h>
#define lowbit(x) (x & -x)
#define eb emplace_back
#define pb push_back
#define mp make_pair
using namespace std;

typedef long long ll;
const int N = 4e5+5;
const int Mod = 998244353;

int n, k;
int p[N * 2];
ll L, a[N], s[N], mn, f[N];

vector<int> x;
vector<ll> ans;

inline ll w(int l, int r) {
    int m1 = (l + r) >> 1;
    int m2 = (l + r - 1) >> 1;
    return s[r] - s[m1] - s[m2] + s[l - 1];
}

namespace wqs {
    int head, tail;
    ll g[N], c[2][N];

    struct info {
        int l, r, p;
    } Q[N];
    
    inline bool cmp(int i, int j, int k, bool t) {
        ll fi = g[i] + w(i + 1, k), fj = g[j] + w(j + 1, k);
        return fi < fj || (!t && fi == fj);
    }

    inline int chk(ll v, bool t) {
        Q[head = tail = 1] = (info) { 1, n, 0 };
        for (int i = 1; i <= n; i++) {
            g[i] = g[Q[head].p] + v + w(Q[head].p + 1, i);
            c[t][i] = c[t][Q[head].p] + 1;
            if (Q[head].r < i + 1) head++;
            Q[head].l = i + 1;
            while (head <= tail && !cmp(Q[tail].p, i, Q[tail].l, t)) tail--;
            if (head > tail) {
                Q[++tail] = (info) { i + 1, n, i };
            } else {
                int L = Q[tail].l + 1, R = Q[tail].r, ans = R + 1;
                while (L <= R) {
                    int mid = (L + R) >> 1;
                    if (!cmp(Q[tail].p, i, mid, t)) ans = mid, R = mid - 1;
                    else L = mid + 1;
                }
                Q[tail].r = ans - 1;
                if (ans <= n) Q[++tail] = (info) { ans, n, i };
            }
        }
        return c[0][n];
    }

    inline void work() {
        ll L = 0, R = 1e18, ans = R + 1;
        while (L <= R) {
            ll mid = (L + R) >> 1;
            if (chk(mid, 0) <= k) ans = mid, R = mid - 1;
            else L = mid + 1;
        }
        chk(ans, 0);
        chk(ans, 1);
        mn = g[n] - ans * k;

        //构造方案
        int cur = 0, lst = n;
        for (int i = n - 1; ~i; i--)
            if (g[i] + ans + w(i + 1, lst) == g[lst] && cur + 1 + c[0][i] <= k && k <= cur + 1 + c[1][i])
                cur++, x.pb(lst = i);
        reverse(x.begin(), x.end());
        x.pb(n);
    }
}

void solve(int l, int r, int L, int R, int d) {
    if (l > r) return;
    int mid = (l + r) >> 1;
    ll g = 1e18;
    for (int i = L; i <= min(mid, R); i++) {
        ll tmp = f[i] + w(i + 1, mid);
        if (tmp <= g) g = tmp, p[mid + d] = i;
    }
    solve(mid + 1, r, p[mid + d], R, d);
    solve(l, mid - 1, L, p[mid + d], d);
    f[mid] = g;
}

void solve(vector<int> L, vector<int> R) {
    if (L[0] > R[0]) return;

    int mid = (L[0] + R[0]) >> 1;

    for (int i = L[1]; i <= R[1]; i++) f[i] = w(mid + 1, i), p[i + 1] = mid;
    for (int i = 2; i < k; i++) solve(L[i], R[i], L[i - 1], R[i - 1], i);
    solve(mid + n, mid + n, L[k - 1], R[k - 1], k);

    vector<int> md(0);
    int cur = mid + n, ck = k;
    while (ck--) md.pb(cur = p[cur + ck + 1]);
    reverse(md.begin(), md.end());
    md.pb(mid + n);

    // puts("-----------");
    // printf("%lld\n", f[mid + n]);
    // for (int i : md) printf("%d ", i);
    // puts("\n------------");

    if (f[mid + n] < mn) {
        mn = f[mid + n];
        x = md;
    }

    md[0]--;
    solve(L, md);
    md[0] += 2;
    solve(md, R);
}

int main() {
    scanf("%d%d%lld", &n, &k, &L);
    for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), s[i] = s[i - 1] + a[i];
    for (int i = n + 1; i <= 2 * n; i++) a[i] = a[i - n] + L, s[i] = s[i - 1] + a[i];

    if (k == 1) {
        int ans = 1;
        for (int i = 2; i <= n; i++) if (w(i, i + n - 1) < w(ans, ans + n - 1)) ans = i;
        printf("%lld\n", w(ans, ans + n - 1));
        printf("%lld", a[ans + (n - 1) / 2] % L);
        return 0;
    }

    wqs::work();

    // printf("%lld\n", mn);
    // for (int i : x) printf("%d ", i); puts("");

    int id = 1;
    for (int i = 1; i <= k; i++)
        if (x[i] - x[i - 1] < x[id] - x[id - 1]) id = i;
    
    vector<int> tl(k + 1), tr(k + 1);
    tl[0] = x[id - 1] + (id == 1);
    tr[0] = x[id];
    for (int i = id + 1; i <= k; i++) tl[i - id] = x[i - 1], tr[i - id] = x[i];
    for (int i = 1; i < id; i++) tl[k - id + i] = x[i - 1] + n, tr[k - id + i] = x[i] + n;

    // for (int i : tl) printf("%d ", i); puts("");
    // for (int i : tr) printf("%d ", i); puts("");

    solve(tl, tr);
    
    printf("%lld\n", mn);
    for (int i = 1; i <= k; i++) ans.pb(a[(x[i] + x[i - 1] + 1) >> 1] % L);

    sort(ans.begin(), ans.end());

    for (ll i : ans) printf("%lld ", i);
    return 0;
}
/*
5 3 10
0 1 3 7 9 
*/