#include <bits/stdc++.h>
#define ll long long
#define pli pair <ll, int>
#define fi first
#define se second
#define pii pair <int, int>
#define pb push_back
#define int long long

using namespace std;
const int N = 1e6+5;
int n, k; 
ll L, a[N], s[N];
vector <int> qs;  
vector <pii> ds; 
ll dis (int l, int r) { 
    if (l > r) return 0;  
    int mid = l+r>>1; 
    return a[mid]*(mid-l)-(s[mid-1]-s[l-1])+s[r]-s[mid]-a[mid]*(r-mid); 
}
int cmp (pli x, pli y) {
    if (x.fi^y.fi) return x.fi < y.fi ? 1 : -1; 
    if (x.se^y.se) return x.se > y.se ? 1 : -1; 
    return 0; 
}
int cmp2 (pli x, pli y) {
    if (x.fi^y.fi) return x.fi < y.fi ? 1 : -1; 
    if (x.se^y.se) return x.se < y.se ? 1 : -1; 
    return 0; 
}
pli tdis (int l, int r) { return {dis(l, r), 1}; }
pli operator + (const pli & a, const pli & b) { return (pli){a.fi+b.fi, a.se+b.se}; }
pli f[N], f2[N]; 
ll ans = 1e18; 
vector <int> td; 
int ft, ed; 
struct node {
    int id, l, r; 
}q[N]; 
int chk (ll c) {
    f[0] = {0, 0}; q[ft = ed = 1] = (node){0, 1, n}; 
    for (int i = 1;i <= n;i++) {
        while (q[ft].r < i) ft++; 
        q[ft].l = i+1; 
        f[i] = f[q[ft].id]+tdis(q[ft].id+1, i); f[i].fi += c; 
        while (ft <= ed && cmp(f[i]+tdis(i+1, q[ed].l), f[q[ed].id]+tdis(q[ed].id+1, q[ed].l)) == 1) ed--; 
        int sl; 
        if (ft <= ed) {
            int l = q[ed].l, r = q[ed].r+1; 
            while (l < r) {
                int mid = l+r>>1; 
                if (cmp(f[i]+tdis(i+1, mid), f[q[ed].id]+tdis(q[ed].id+1, mid)) == 1) r = mid; 
                else l = mid+1; 
            }
            if (l <= q[ed].r) q[ed].r = l-1; sl = l; 
        } else sl = i+1; 
        if (sl <= n) q[++ed] = (node){i, sl, n};
    }
    return f[n].se; 
}

int ps[N]; 
ll g[N], ng[N]; 
vector <ll> tg[N]; 
void sol (int l, int r, int tl, int tr) {
    if (l > r) return; 
    int mid = l+r>>1, p; ll mn = 1e18; 
    for (int i = tl;i <= mid && i <= tr;i++) if (g[i]+dis(i+1, mid) < mn) mn = g[i]+dis(i+1, mid), p = i; 
    ng[mid] = mn; 
    sol(l, mid-1, tl, p); sol(mid+1, r, p, tr);  
}
void solve (int l, int r, vector <pii> ds) {
    if (l > r) return; 
    int mid = l+r>>1; 
    vector <int> sp; 
    int sl, sr; sl = sr = mid; 
    g[mid] = 0; 
    for (int i = 0;i < ds.size();i++) {
        sol(ds[i].fi, ds[i].se, sl, sr); 
        sl = ds[i].fi; sr = ds[i].se; 
        tg[i].clear(); 
        for (int j = sl;j <= sr;j++) g[j] = ng[j], tg[i].push_back(g[j]); 
    }
    int p; ll mn = 1e18; 
    for (int i = sl;i <= sr;i++) if (g[i]+dis(i+1, mid+n) < mn) mn = g[i]+dis(i+1, mid+n), p = i;
    sp.push_back(p); 
    for (int i = 1l*ds.size()-2;i >= 0;i--) {
        for (int j = 0;j < tg[i].size();j++) if (tg[i][j]+dis(j+ds[i].fi+1, p) == tg[i+1][p-ds[i+1].fi]) { sp.push_back(j+ds[i].fi); p = j+ds[i].fi; break; }
    }
    reverse(sp.begin(), sp.end()); 
    // cout << sp.size() << " " << k << endl; 
    // assert(sp.size() == k-1); 
    if (mn < ans) {
        ans = mn; td = sp; td.push_back(mid+n); 
    }
    vector <pii> nd; 
    for (int i = 0;i < ds.size();i++) nd.pb({ds[i].fi, sp[i]}); 
    solve(l, mid-1, nd); 
    for (int i = 0;i < ds.size();i++) nd[i] = {sp[i], ds[i].se}; 
    solve(mid+1, r, nd);   
} 
inline ll mod (ll x) { return x < L ? x : x-L; }

signed main () {
    cin >> n >> k >> L; 
    for (int i = 1;i <= n;i++) cin >> a[i], a[i+n] = a[i]+L; 
    // if (k == 1) {
    //     assert(0); 
    //     cout << dis(1, n);// << "\n" << a[(1+n)/2]; 
    //     return 0; 
    // }
    for (int i = 1;i <= 2*n;i++) s[i] = s[i-1]+a[i];
    ll l = 0, r = 1e18; 
    while (l < r) {
        ll mid = l+r+1>>1; 
        if (chk(mid) >= k) l = mid;
        else r = mid-1; 
    } 
    chk(l); 
    f2[0] = {0, 0}; q[ft = ed = 1] = (node){0, 1, n}; 
    for (int i = 1;i <= n;i++) {
        while (q[ft].r < i) ft++; 
        q[ft].l = i+1; 
        f2[i] = f2[q[ft].id]+tdis(q[ft].id+1, i); f2[i].fi += l; 
        while (ft <= ed && cmp2(f2[i]+tdis(i+1, q[ed].l), f2[q[ed].id]+tdis(q[ed].id+1, q[ed].l)) == 1) ed--; 
        int sl; 
        if (ft <= ed) {
            int l = q[ed].l, r = q[ed].r+1; 
            while (l < r) {
                int mid = l+r>>1; 
                if (cmp2(f2[i]+tdis(i+1, mid), f2[q[ed].id]+tdis(q[ed].id+1, mid)) == 1) r = mid; 
                else l = mid+1; 
            }
            if (l <= q[ed].r) q[ed].r = l-1; sl = l; 
        } else sl = i+1; 
        if (sl <= n) q[++ed] = (node){i, sl, n};
    }
    qs.pb(n); 
    for (int i = n-1;i >= 1;i--) if (f[qs.back()].fi == f[i].fi+dis(i+1, qs.back())+l && f2[i].se <= k-qs.size() && k-qs.size() <= f[i].se) qs.push_back(i);
    qs.push_back(0); 
    reverse(qs.begin(), qs.end());
    int st = -1; 
    for (int i = 1;i <= k;i++) qs.pb(qs[i]+n); 
    for (int i = 1;i < qs.size();i++) if (qs[i]-qs[i-1] <= n/k) { st = i-1; break; }
    for (int i = st+1;i < st+k;i++) ds.pb({qs[i], qs[i+1]});
    solve(qs[st], qs[st+1], ds); 
    cout << ans << "\n"; 
    // return 0; 
    st = td.back()-n; 
    vector <ll> fd; 
    for (int i : td) {
        fd.pb(mod(a[(st+1+i)/2])); st = i; 
    }
    sort(fd.begin(), fd.end()); 
    // assert(fd.size() == k); return 0; 
    for (ll j : fd) cout << j << " "; 
    return 0; 
}