#!/usr/bin/python3

# Nacteme vstup
T = int(input())
M = int(input())
P = int(input())

# Ulozime si pole
pole = [int(x) for x in input().strip().split(" ")]

# Prubezne ukladani maxima a aktualniho useku
max_posekano = 0
max_zacatek = 0
posekano = 0

# Zacneme na useku o delce M na zacatku
for i in range(M):
    posekano += T - pole[i]
max_posekano = posekano

# Postupne posouvame usek o 1
for i in range(0, P-M):
    posekano -= T - pole[i]
    posekano += T - pole[i+M]
    if posekano > max_posekano:
        max_posekano = posekano
        max_zacatek = i+1

# Vypiseme maximum
print(max_zacatek, max_posekano)