#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

int main() {
    int N,D,K; cin >> N >> D >> K;
    vector<ll> kabu(N);
    rep(i,N) cin >> kabu[i];

    deque<int> dq;
    int s = -1,t = -1;
    ll ans = 0;
    rep(i,N) {
        while (!dq.empty() && dq.front() < i - D) dq.pop_front();
        if (!dq.empty()) {
            if (ans < kabu[i] - kabu[dq.front()]) {
                ans = kabu[i] - kabu[dq.front()];
                s = dq.front(); t = i;
            }
        }
        while (!dq.empty() && kabu[dq.back()] > kabu[i]) dq.pop_back();
        dq.push_back(i);
    }
    ans *= (ll)K;
    cout << ans << '\n';
    if (ans) cout << s << ' ' << t << '\n';
    return 0;
}