main = do
 [n,d,k] <- map read . words <$> getLine
 xs <- map read . words <$> getContents
 let (pmax, jk) = kabu n d k xs
 print (k * pmax)
 maybe (return ()) (\(j,k) -> putStrLn (show j ++ " " ++ show k)) jk

kabu n d k xs = foldl (update n seg) (0,Nothing) [(j,j+d) | j<-[0..n-d-1]]
 where seg = fromList n (zipWith (\i x -> ((i,i),(x,x))) [0..] xs)

update n seg (pmax,jk) (j,k)
 | profit p > pmax = (profit p, Just i)
 | otherwise = (pmax, jk)
 where 
  (i,p) = query n seg j k
  profit (x,y) = y - x


data SegTree a = Leaf a | Node a (SegTree a) (SegTree a) deriving (Eq, Ord, Show)

minmax ((i,j),(a,b)) ((k,l),(c,d))
 | max a b < y = ((i,l),(x,y))
 | otherwise = ((i,j),(x,y))
 where
  x = min a b
  y = max c d

val (Leaf v) = v
val (Node v _ _) = v

fromList 1 [x] = Leaf x
fromList n xs  = Node (minmax (val left) (val right)) left right
 where
  n' = div n 2
  (xs1,xs2) = splitAt n' xs
  left = fromList n' xs1
  right = fromList (n-n') xs2

query 1 (Leaf v) 0 0 = v
query n (Node v l r) i j
 | (i,j) == (0,n-1) = v
 | j < n' = query n' l i j
 | i >= n' = query (n-n') r (i-n') (j-n')
 | otherwise = minmax (query n' l i (n'-1)) (query (n-n') r 0 (j-n'))
 where n' = div n 2