/*
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃＼○／
┛┗┛┗┛┃ / /
┓┏┓┏┓┃ノ
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃┓
┛┗┛┗┛┃┃
*/

// #define pragma

#ifdef pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Wunused-result"
#endif // pragma

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define pb push_back
#define x first
#define y second
#define int long long
#define zero(x) memset(x, 0, sizeof(x))

using namespace std;
using namespace __gnu_pbds;


typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef long double ld;
typedef vector<vi> matrix;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(10);
    #if 1
        freopen("input", "r", stdin);
        freopen("output", "w", stdout);
    #endif
}

const int INF = 1e9 + 7;

signed main() {
    seriy();
    int n;
    cin >> n;
    vi a(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int k;
    cin >> k;
    int dp[k + 2][n + 1];
    zero(dp);
    int sm = 0;
    for(int i = 1; i <= n; i++) {
        sm += a[i];
        dp[1][i] = sm;
    }
    for(int i = 2; i <= k; i++) {
        for(int j = i; j <= n; j++) {
            int mn = INF;
            vi mx(n + 2);
            for(int m = 1; m < j; m++) {
                mx[m] = max(mx[m - 1], dp[i - 1][m]);
            }
            int sum = a[j];
            for(int m = j - 1; m >= 1; m--) {
                // cerr << i << " " << j << " " << mx[m] << " " << sum << '\n';
                mn = min(mn, max(mx[m], sum));
                sum += a[m];
            }
            dp[i][j] = mn;
        }
    }
    // cerr << '\n';
    // for(int i = 1; i <= k; i++) {
    //     for(int j = 1; j <= n; j++) {
    //         cerr << dp[i][j] << " ";
    //     }
    //     cerr << '\n';
    // }
    cout << dp[k][n];
    return 0;
}