#include<bits/stdc++.h>
using namespace std;
int main()
{
int ar[] = {-2,-3,11};
int K = 8;
set<int> cumset;
cumset.insert(0);
int best=0,cum=0;
for(int i=0;i<3;i++)
{
cum+=ar[i];
set<int>::iterator sit=cumset.lower_bound(cum-K);
if(sit!=cumset.end())
{
best=max(best,cum-*sit);
}
cumset.insert(cum);
}
cout<<best;
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpCnsKCQoJaW50IGFyW10gPSB7LTIsLTMsMTF9OwoJaW50IEsgPSA4OwoJCglzZXQ8aW50PiBjdW1zZXQ7CiAgICBjdW1zZXQuaW5zZXJ0KDApOwogICAgaW50IGJlc3Q9MCxjdW09MDsKICAgIGZvcihpbnQgaT0wO2k8MztpKyspCiAgICB7CiAgICAgICAgY3VtKz1hcltpXTsKICAgICAgICBzZXQ8aW50Pjo6aXRlcmF0b3Igc2l0PWN1bXNldC5sb3dlcl9ib3VuZChjdW0tSyk7CiAgICAgICAgCiAgICAgICAgCiAgICAgICAgaWYoc2l0IT1jdW1zZXQuZW5kKCkpCiAgICAgICAgewogICAgICAgIAliZXN0PW1heChiZXN0LGN1bS0qc2l0KTsKICAgICAgICB9CiAgICAgICAgY3Vtc2V0Lmluc2VydChjdW0pOwogICAgfQogICAgCiAgICBjb3V0PDxiZXN0OwoJcmV0dXJuIDA7Cn0=