#include<bits/stdc++.h>
using namespace std;
namespace io
{
	const int size = (1 << 20) + 1;
	char buf[size], *p1 = buf, *p2 = buf;
	char buffer[size];
	int op1 = -1;
	const int op2 = size - 1;
	struct FastIO
	{
		inline char readchar()
		{
			return p1 != p2 ? *p1++ : p1 == (p2 = (p1 = buf) + fread(buf, 1, size - 1, stdin)) ? EOF
																							   : *p1++;
		}	
// #ifndef ONLINE_JUDGE
// #define readchar getchar
// #endif
		inline char rc()
		{
			char c=readchar();
			while(c<32 || c==127) c=readchar();
			return c;
		}
		inline void flush()
		{
			fwrite(buffer, 1, op1 + 1, stdout), op1 = -1;
		}
		inline void writechar(const char &x)
		{
			if (op1 == op2)
				flush();
			buffer[++op1] = x;
		}
		inline int readint()
		{
			int s = 1, x = 0;
			char c = readchar();
			while (c <= 32)
			{
				c = readchar();
			}
			if (c == '-')
			{
				s = -1, c = readchar();
			}
			while ('0' <= c && c <= '9')
			{
				x = x * 10 + c - '0';
				c = readchar();
			}
			return x * s;
		}
		inline int readuint()
		{
			int x = 0;
			char c = readchar();
			while (c <= 32)
			{
				c = readchar();
			}
			while ('0' <= c && c <= '9')
			{
				x = x * 10 + c - '0';
				c = readchar();
			}
			return x;
		}
		inline void writeint(int x)
		{
			if (x < 0)
			{
				writechar('-'), x = -x;
			}
			char s[24];
			int n = 0;
			while (x || !n)
			{
				s[n++] = '0' + x % 10, x /= 10;
			}
			while (n--)
			{
				writechar(s[n]);
			}
		}
		inline void writeuint(unsigned x)
		{
			char s[24];
			int n = 0;
			while (x || !n)
			{
				s[n++] = '0' + x % 10, x /= 10;
			}
			while (n--)
			{
				writechar(s[n]);
			}
		}
		inline long long readlonglong()
		{
			long long x = 0, s = 1;
			char c = readchar();
			while (c <= 32)
			{
				c = readchar();
			}
			if (c == '-')
			{
				s = -1, c = readchar();
			}
			while ('0' <= c && c <= '9')
			{
				x = x * 10 + c - '0';
				c = readchar();
			}
			return x * s;
		}
		inline unsigned long long readulonglong()
		{
			unsigned long long x = 0;
			char c = readchar();
			while (c <= 32)
			{
				c = readchar();
			}
			while ('0' <= c && c <= '9')
			{
				x = x * 10 + c - '0';
				c = readchar();
			}
			return x;
		}
		inline void writelonglong(long long x)
		{
			if (x < 0)
			{
				writechar('-'), x = -x;
			}
			char s[25];
			int n = 0;
			while (x || !n)
			{
				s[n++] = '0' + x % 10, x /= 10;
			}
			while (n--)
			{
				writechar(s[n]);
			}
		}
		inline void writeulonglong(unsigned long long x)
		{
			char s[25];
			int n = 0;
			while (x || !n)
			{
				s[n++] = '0' + x % 10, x /= 10;
			}
			while (n--)
			{
				writechar(s[n]);
			}
		}
		inline int readstring(char *s)
		{
			int cnt = 0;
			char c = readchar();
			while (c <= 32)
			{
				c = readchar();
			}
			while (c > 32)
			{
				*s++ = c, ++cnt;
				c = readchar();
			}
			return *s = 0, cnt;
		}
		inline void writestring(const char *s)
		{
			while (*s)
			{
				writechar(*s++);
			}
		}
		inline double readdouble()
		{
			int zheng = 0, fuhao = 1;
			double xiao = 0, chushu = 10;
			char c;
			while ((c = readchar()) < '0' || c > '9')
			{
				if (c == '-')
				{
					fuhao = -1;
				}
			}
			while (c >= '0' && c <= '9')
			{
				zheng = zheng * 10 + c - '0';
				c = readchar();
			}
			if (c != '.')
			{
				return fuhao * zheng;
			}
			while ((c = readchar()) >= '0' && c <= '9')
			{
				xiao += (c - '0') / chushu;
				chushu *= 10;
			}
			return fuhao * (zheng + xiao);
		}
	} io;
#define readc io::io.rc
#define writec io::io.writechar
#define read io::io.readint
#define readu io::io.readuint
// #define write io::io.writeint
#define writeu io::io.writeuint 
#define readl io::io.readlonglong
#define readlu io::io.readulonglong
#define writel io::io.writelonglong
#define writelu io::io.writeulonglong
#define reads io::io.readstring
#define writes io::io.writestring
#define readd io::io.readdouble
#define flush io::io.flush
} using namespace io;
int n,m;
int a[1000010];
int tot=0,lsh[1000010];
vector<int> vec[1000010];
void write(__int128 x)
{
	if(x==0) return putchar('0'),void();
	int tot=0,dig[40];
	while(x!=0) dig[++tot]=x%10,x/=10;
	for(int i=tot; i>=1; --i) putchar(dig[i]+'0');
}
struct Tree
{
	int firl,secl,firr,secr; // 最小的 l，最大的 r 
	__int128 suma,sumla,sumra,sumlra;
	__int128 lsum1,lsum2;
	__int128 rsum1,rsum2;
	__int128 sum;
} tree[(1<<21)+10];
inline void push_up(int now)
{
	if(tree[now<<1].firl<tree[now<<1|1].firl)
	{
		tree[now].firl=tree[now<<1].firl,tree[now].secl=min(tree[now<<1].secl,tree[now<<1|1].firl);
		tree[now].sumra=tree[now<<1].sumra;
		tree[now].lsum2=tree[now<<1].lsum2;
	}
	else if(tree[now<<1].firl==tree[now<<1|1].firl)
	{
		tree[now].firl=tree[now<<1].firl,tree[now].secl=min(tree[now<<1].secl,tree[now<<1|1].secl);
		tree[now].sumra=tree[now<<1].sumra+tree[now<<1|1].sumra;
		tree[now].lsum2=tree[now<<1].lsum2+tree[now<<1|1].lsum2;
	}
	else
	{
		tree[now].firl=tree[now<<1|1].firl,tree[now].secl=min(tree[now<<1].firl,tree[now<<1|1].secl);
		tree[now].sumra=tree[now<<1|1].sumra;
		tree[now].lsum2=tree[now<<1|1].lsum2;
	}
	if(tree[now<<1].firr>tree[now<<1|1].firr)
	{
		tree[now].firr=tree[now<<1].firr,tree[now].secr=max(tree[now<<1].secr,tree[now<<1|1].firr);
		tree[now].sumla=tree[now<<1].sumla;
		tree[now].rsum2=tree[now<<1].rsum2;
	}
	else if(tree[now<<1].firr==tree[now<<1|1].firr)
	{
		tree[now].firr=tree[now<<1].firr,tree[now].secr=max(tree[now<<1].secr,tree[now<<1|1].secr);
		tree[now].sumla=tree[now<<1].sumla+tree[now<<1|1].sumla;
		tree[now].rsum2=tree[now<<1].rsum2+tree[now<<1|1].rsum2;
	}
	else
	{
		tree[now].firr=tree[now<<1|1].firr,tree[now].secr=max(tree[now<<1].firr,tree[now<<1|1].secr);
		tree[now].sumla=tree[now<<1|1].sumla;
		tree[now].rsum2=tree[now<<1|1].rsum2;
	}
	tree[now].suma=0;
	if(tree[now<<1].firl<=tree[now<<1|1].firl && tree[now<<1].firr>=tree[now<<1|1].firr)
	{
		tree[now].suma+=tree[now<<1].suma;
	}
	if(tree[now<<1|1].firl<=tree[now<<1].firl && tree[now<<1|1].firr>=tree[now<<1].firr)
	{
		tree[now].suma+=tree[now<<1|1].suma;
	}
	tree[now].sumlra=tree[now<<1].sumlra+tree[now<<1|1].sumlra;
	tree[now].lsum1=tree[now<<1].lsum1+tree[now<<1|1].lsum1;
	tree[now].rsum1=tree[now<<1].rsum1+tree[now<<1|1].rsum1;
	tree[now].sum=tree[now<<1].sum+tree[now<<1|1].sum; 
}
inline void upd_l(int now,int l)
{
	tree[now].sumlra+=(l-tree[now].firl)*tree[now].sumra;
	tree[now].sumla+=(l-tree[now].firl)*tree[now].suma;
	tree[now].lsum1+=(l-tree[now].firl)*tree[now].lsum2;
	tree[now].firl=l;
}
inline void upd_r(int now,int r)
{
	tree[now].sumlra-=(tree[now].firr-r)*tree[now].sumla;
	tree[now].sumra-=(tree[now].firr-r)*tree[now].suma;
	tree[now].rsum1-=(tree[now].firr-r)*tree[now].rsum2;
	tree[now].firr=r;
}
inline void push_down(int now)
{
	int inl=min(tree[now<<1].firl,tree[now<<1|1].firl),axr=max(tree[now<<1].firr,tree[now<<1|1].firr);
	if(inl!=tree[now].firl)
	{
		if(tree[now<<1].firl==inl) upd_l(now<<1,tree[now].firl);
		if(tree[now<<1|1].firl==inl) upd_l(now<<1|1,tree[now].firl);
	}
	if(axr!=tree[now].firr)
	{
		if(tree[now<<1].firr==axr) upd_r(now<<1,tree[now].firr);
		if(tree[now<<1|1].firr==axr) upd_r(now<<1|1,tree[now].firr);
	}
}
bool upd_max(int now,int l,int r,int ql,int qr,int qz)
{
	if(tree[now].firl>=qz) return 0;
	if(ql<=l && r<=qr && tree[now].secl>qz) return upd_l(now,qz),1;
	int mid=l+r>>1; bool change=0; push_down(now);
	if(ql<=mid) change|=upd_max(now<<1,l,mid,ql,qr,qz);
	if(qr>mid) change|=upd_max(now<<1|1,mid+1,r,ql,qr,qz);
	if(change) push_up(now);
	return change;
}
bool upd_min(int now,int l,int r,int ql,int qr,int qz)
{
	if(tree[now].firr<=qz) return 0;
	if(ql<=l && r<=qr && tree[now].secr<qz) return upd_r(now,qz),1;
	int mid=l+r>>1; bool change=0; push_down(now);
	if(ql<=mid) change|=upd_min(now<<1,l,mid,ql,qr,qz);
	if(qr>mid) change|=upd_min(now<<1|1,mid+1,r,ql,qr,qz);
	if(change) push_up(now);
	return change;
}
void upd(int now,int l,int r,int qx,__int128 qa,int ql,int qr)
{
	if(l==r) return tree[now]={ql,(int)1e9,qr,0,-qa,-qa*ql,-qa*qr,-qa*ql*qr,
	qa*(qx-1)*ql,qa*(qx-1),qa*(qx+1)*qr,qa*(qx+1),-qa*(qx+1)*(qx-1)},void();
	int mid=l+r>>1; push_down(now);
	if(qx<=mid) upd(now<<1,l,mid,qx,qa,ql,qr);
	else upd(now<<1|1,mid+1,r,qx,qa,ql,qr);
	push_up(now);
}
void build(int now,int l,int r)
{
	if(l==r)
	{
		__int128 a=lsh[tot];
		tree[now]={1,(int)1e9,l,0,-a,-a,-a*l,-a*l,a*(l-1),a*(l-1),a*(l+1)*l,a*(l+1),-a*(l+1)*(l-1)};
		return;
	}
	int mid=l+r>>1;
	build(now<<1,l,mid),build(now<<1|1,mid+1,r);
	push_up(now);
}
signed main()
{
	n=read(),m=read();
	lsh[++tot]=m+1;
	for(int i=1; i<=n; ++i) a[i]=read(),lsh[++tot]=a[i];
	sort(lsh+1,lsh+tot+1),tot=unique(lsh+1,lsh+tot+1)-lsh-1;
	for(int i=1; i<=n; ++i) vec[lower_bound(lsh+1,lsh+tot+1,a[i])-lsh].push_back(i);
	build(1,1,n);
	__int128 ans=0;
	for(int i=tot; i>=1; --i)
	{
		__int128 sum1=tree[1].sumlra+tree[1].lsum1+tree[1].rsum1+tree[1].sum;
		for(int j:vec[i])
		{
			if(j!=1) upd_min(1,1,n,1,j-1,j-1);
			if(j!=n) upd_max(1,1,n,j+1,n,j+1);
		}
		__int128 sum2=0; 
		for(int j=0; j<vec[i].size(); ++j)
		{
			int wz=vec[i][j];
			int l=1,r=(j==vec[i].size()-1?n:vec[i][j+1]-1);
			upd(1,1,n,wz,lsh[i],l,r);
			sum2-=(__int128)lsh[i]*(wz-l+1)*(r-wz+1);
		}
		sum2+=tree[1].sumlra+tree[1].lsum1+tree[1].rsum1+tree[1].sum;
		long long cnt=1ll*(n+1)*n/2; int lst=0;
		for(int j:vec[i]) cnt-=1ll*(j-lst)*(j-lst-1)/2,lst=j;
		cnt-=1ll*(n-lst+1)*(n-lst)/2;
		ans+=lsh[i]*(sum1-sum2-(__int128)cnt*lsh[i]);
	}
	write(ans);
	return 0;
}