// infoarena: http://infoarena.ro/problema/perle2
#include <fstream>
using namespace std;

ifstream in("perle2.in");
ofstream out("perle2.out");
int temp,max;
int a[100001];
int main()
{
	int n,K,st,dr,i;
	in>>n>>K;
	st=1;dr=0;
	for (i=1;i<=n;i++)
	{
		in>>a[i];a[i]-=K;
	}
	int suma=0,max=0;
	for (st=1;st<=n;st++)
	{
		while (dr<=n && suma>=0)
		{
			dr++;
			suma+=a[dr];
			if (suma>max)
			{
				max=suma;
			}
		}
		suma-=a[st];
	}
	out<<max; 
	return 0;
}