#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>

int minMaxTime = INT_MAX;

int max(int* arr, int size) {
    int maxVal = arr[0];
    for (int i = 1; i < size; i++) {
        if (arr[i] > maxVal) maxVal = arr[i];
    }
    return maxVal;
}

void backtrack(int index, int* jobs, int jobsSize, int* workers, int k) {
    if (index == jobsSize) {
        int maxTime = max(workers, k);
        if (maxTime < minMaxTime) {
            minMaxTime = maxTime;
        }
        return;
    }
    
    for (int i = 0; i < k; i++) {
        workers[i] += jobs[index];
        backtrack(index + 1, jobs, jobsSize, workers, k);
        workers[i] -= jobs[index];
    }
}

int minimumTimeRequired(int* jobs, int jobsSize, int k) {
    minMaxTime = INT_MAX;
    int* workers = (int*)calloc(k, sizeof(int));
    backtrack(0, jobs, jobsSize, workers, k);
    free(workers);
    return minMaxTime;
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    
    int jobs[20];
    int jobsSize = 0;
    char* token = strtok(line, " \n");
    while (token != NULL) {
        jobs[jobsSize++] = atoi(token);
        token = strtok(NULL, " \n");
    }
    
    int k;
    scanf("%d", &k);
    
    printf("%d\n", minimumTimeRequired(jobs, jobsSize, k));
    return 0;
}