N, D, K = map( int, input().split() )
X = list( int( input() ) for i in range( N ) )

def build( maxv, t, lb, rb ):
  if lb + 1 == rb:
    maxv[ t ] = [ X[ lb ], - lb ]
    return
  mid = lb + rb >> 1
  build( maxv, t << 1, lb, mid )
  build( maxv, t << 1 | 1, mid, rb )
  maxv[ t ] = max( maxv[ t << 1 ], maxv[ t << 1 | 1 ] )

maxv = [ [ 0, 0 ] for i in range( N << 2 ) ]
build( maxv, 1, 0, N )

def query( t, lb, rb, ql, qr ):
  if qr <= lb or rb <= ql:
    return [ -1, -1 ]
  if ql <= lb and rb <= qr:
    return maxv[ t ]
  mid = lb + rb >> 1
  return max( query( t << 1, lb, mid, ql, qr ), query( t << 1 | 1, mid, rb, ql, qr ) )

best = 0
bl, br = -1, -1
for i in range( N - 1 ):
  mx = query( 1, 0, N, i + 1, min( N, i + D + 1 ) )
  if best >= mx[ 0 ] - X[ i ]: continue
  best = mx[ 0 ] - X[ i ]
  bl, br = i, -mx[ 1 ]

print( best * K )
if bl != -1:
  print( bl, br )