// compile: g++ -o data data.cpp -O3 -std=gnu++20 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) {_variables(#x);_print(x);}
#else
#define debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INTINF (int)(1152921504606846976)
#define int long long
#define MAXN 200010

int n, m, k, a[MAXN];
set<pair<int, int>> A, B;

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    cin >> n >> m >> k;
    rep(i, 0, n) cin >> a[i];
    vector<pair<int, int>> v;
    rep(i, 0, m) v.push_back({a[i], i});
    sort(v.begin(), v.end());
    int sum = 0;
    rep(i, 0, k) A.insert(v[i]), sum += v[i].first;
    rep(i, k, m) B.insert(v[i]);
    cout << sum;
    rep(i, 0, n-m) {
        pair<int, int> head = {a[i], i}, tail = {a[i+m], i+m};
        if (A.find(head) != A.end()) sum -= head.first, A.erase(A.find(head));
        else B.erase(B.find(head));
        if (tail < *(B.begin())) sum += tail.first, A.insert(tail);
        else B.insert(tail);
        if (sz(A) < k) sum += B.begin()->first, A.insert(*(B.begin())), B.erase(B.begin());
        if (sz(A) > k) sum -= A.rbegin()->first, B.insert(*(A.rbegin())), A.erase(--A.end());
        cout << " " << sum;
    }
    cout << endl;

    return 0;
}