#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ferma.in");
ofstream g("ferma.out");
int mrk[3][20005],n,k,v[20005],s,i1,i2,best,ind,j=1,inf=(1<<30);
int bestmin,I1,I2;
bool ok=true;

void SSM()
{
    s=-1; best=-inf;
    for(int i=1;i<2*n;++i)
    {
        if(i==ind+n) break;
        while(mrk[0][i]==1)
        {
            s=-1; ++i;
        }
        if(s<0)
        {
            s=v[i];
            ind=i;
        }
        else s+=v[i];
        if(s>best)
        {
            i1=ind;
            i2=i;
            best=s;
        }
    }
}



int main()
{
    f>>n>>k;
    for(int i=1;i<=n;++i) f>>v[i];
    for(int i=1;i<=n;++i) v[i+n]=v[i];
    while(ok==true)
    {
        ok=false;
        SSM();
        SSm();
    }
    return 0;
}