#include "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lsb(x) (x&(-x))
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
cerr << #x << " : ";\
for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
cerr << "outputting " << #j<< ":\n";\
for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}
#define vi vector<int>
#define vpii vector<pii>
#define fr(i,x,y) for(int i=x;i<=y;i++)
long long find_shortcut(int n, vector<int> l, vector<int> d, int c)
{
#define int long long
vector<int>pref(n),suff(n);
pref[0]=d[0];suff[n-1]=d[n-1];
for(int i=1;i<n;i++){pref[i]=max((int)pref[i-1]+(int)l[i-1],(int)d[i]);}
for(int i=n-2;i>=0;i--){suff[i]=max((int)suff[i+1]+(int)l[i],(int)d[i]);}
int ans=LLONG_MAX;
for(int s=0;s<n;s++)
{
for(int e=s+1;e<n;e++)
{
int tots=c;
fr(i,s,e-1){tots+=l[i];}
int cmax=0;
for(int i=0;i<s;i++)
{
int curr=0;
for(int ii=i+1;ii<s;ii++)
{
curr+=l[ii-1];
cmax=max(cmax,curr+d[i]+d[ii]);
}
}
for(int i=e;i<n;i++)
{
int curr=0;
for(int ii=i+1;ii<n;ii++)
{
curr+=l[ii-1];
cmax=max(cmax,curr+d[i]+d[ii]);
}
}
vector<int>amt(n);
for(int i=0;i<n;i++){amt[i]=d[i];}
amt[s]=pref[s];amt[e]=suff[e];
for(int i=s;i<=e;i++)
{
int curr=0;
for(int ii=i+1;ii<=e;ii++)
{
curr+=l[ii-1];
cmax=max(cmax,amt[i]+amt[ii]+min(tots-curr,curr));
}
}
ans=min(ans,cmax);
}
}
#undef int
return ans;
}
