网易之chorus

# -*- coding:utf-8 -*-
def Chorus():
    n = int(input())
    arr = list(map(int,input().split()))
    K,D = map(int,input().split())
    fm = [ ([0]*n) for i in range(K) ] # k*d
    fn = [ ([0]*n) for i in range(K) ] # k*d
    res=0
    for i in list(range(n)):
        fm[0][i]=arr[i]
        fn[0][i]=arr[i]
    for i in range(n):
        for k in range(1,K):
            for j in range(i-1,max(0,i-D)-1,-1):
             #if (i-j0):
                fm[k][i] = max(fm[k][i],max(fm[k-1][j]*arr[i], fn[k-1][j]*arr[i]))
                fn[k][i] = min(fn[k][i],min(fm[k-1][j]*arr[i], fn[k-1][j]*arr[i]))
        res=max(res,fm[K-1][i])
    return res
print(Chorus())