#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i32 = int; using i64 = long long int; using f64 = double; using str = string;
template <typename T> using vec = vector<T>;
template <typename T> using heap = priority_queue<T, vec<T>, greater<T>>;
#define times(n, i) for (i32 i = 0; i < (n); ++i)
#define range(a, b, i) for (i32 i = (a); i < (b); ++i)
#define upto(a, b, i) for (i32 i = (a); i <= (b); ++i)
#define downto(a, b, i) for (i32 i = (a); i >= (b); --i)
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) (xs).erase(unique(all(xs)), (xs).end())
#define even(x) (((x) & 1) == 0)
#define odd(x) (((x) & 1) == 1)
#define append emplace_back
const i64 MOD = 1000000007;

i32 n, d, k;
i32 x[100000];

i32 main()
{
    cin >> n >> d >> k;
    set<pair<i32, i32>> s; s.insert(make_pair(INT_MAX, -1));
    i32 jj = 0, kk = 0; i64 dd = 0;
    times(n, i) {
        cin >> x[i];
        i32 minx = s.begin()->first;
        i32 mini = s.begin()->second;
        if (x[i] - minx > dd) {
            dd = x[i] - minx;
            jj = mini;
            kk = i;
        }
        s.insert(make_pair(x[i], i));
        while (s.begin()->second <= i-d) {
            s.erase(s.begin());
        }
    }

    if (dd == 0) {
        cout << 0 << endl;
    } else {
        cout << dd*k << endl;
        cout << jj << " " << kk << endl;
    }
    return 0;
}