n, k, s = map(int, input().split())
arr = []
arr.append(list(map(int, input().split())))
arr.append(list(map(int, input().split())))
x, y = map(int, input().split())
arr1 = []
for i in range(1, k + 1):
    arr1.append([])
    for j in range(n):
        arr1[-1].append(arr[0][j] * i + arr[1][j])
max_chet = 0
for i in range(n):
    new_i = i
    chet = arr1[k-1][new_i]
    for j in range(k - 1, -1, -1):
        if y + new_i < n and j > 0:
            if new_i - x > 0:
                if arr1[j - 1][new_i] >= arr1[j - 1][new_i + y] and arr1[j - 1][new_i] >= arr1[j - 1][new_i - x]:
                    chet +=arr1[j-1][new_i]
                elif arr1[j - 1][new_i + y] > arr1[j - 1][new_i] and arr1[j - 1][new_i + y] > arr1[j - 1][new_i - x]:
                    chet +=arr1[j-1][new_i+y]
                    new_i += y
                else:
                    chet +=arr1[j-1][new_i-x]
                    new_i -= x
            else:
                if arr1[j - 1][new_i] > arr1[j - 1][new_i + y]:
                    chet += arr1[j-1][new_i]
                else:
                    chet += arr1[j-1][new_i+y]
                    new_i += y
        elif new_i - x > 0 and j > 0:
            if arr1[j - 1][new_i] > arr1[j - 1][new_i - x]:
                chet += arr1[j-1][new_i]
            else:
                chet += arr1[j-1][new_i-x]
                new_i -= x
        elif j > 0 and new_i - x <= 0 and new_i + y >= n:
            chet +=arr1[j-1][new_i]
    max_chet = max(max_chet,chet)
print(max_chet+arr[0][s-1])