#include <vector>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 500010
using namespace std;
typedef long long ll;
vector<int> v[N];
int l[N] , r[N] , rnd[N] , tot , root , a[N];
ll vp[N] , tag[N] , wk[N] , wb[N] , ws[N] , sk[N] , sb[N] , ss[N];
inline void add(int k , ll x)
{vp[k] += x;ws[k] += (2 * wb[k] - (x + 1) * wk[k]) * x / 2;ss[k] += (2 * sb[k] - (x + 1) * sk[k]) * x / 2;wb[k] -= wk[k] * x;sb[k] -= sk[k] * x;tag[k] += x;
}
inline void pushup(int k)
{sk[k] = sk[l[k]] + sk[r[k]] + wk[k];sb[k] = sb[l[k]] + sb[r[k]] + wb[k];ss[k] = ss[l[k]] + ss[r[k]] + ws[k];
}
inline void pushdown(int k)
{if(tag[k]) add(l[k] , tag[k]) , add(r[k] , tag[k]) , tag[k] = 0;
}
inline void zig(int &k)
{int t = l[k];l[k] = r[t] , r[t] = k , pushup(k) , pushup(t) , k = t;
}
inline void zag(int &k)
{int t = r[k];r[k] = l[t] , l[t] = k , pushup(k) , pushup(t) , k = t;
}
void insert(int &k , ll p , ll xk , ll xb)
{if(!k){k = ++tot , vp[k] = p , wk[k] = sk[k] = xk , wb[k] = sb[k] = xb , ws[k] = ss[k] = xb * (p + 1) / 2 , rnd[k] = rand();return;}pushdown(k);if(p < vp[k]){insert(l[k] , p , xk , xb) , pushup(k);if(rnd[l[k]] < rnd[k]) zig(k);}else{insert(r[k] , p , xk , xb) , pushup(k);if(rnd[r[k]] < rnd[k]) zag(k);}
}
ll query(int k , ll p)
{if(!k) return 0;pushdown(k);if(p < vp[k]) return (2 * (wb[k] + sb[r[k]]) + (wk[k] + sk[r[k]]) * p) * (p + 1) / 2 + query(l[k] , p);else return ws[k] + ss[l[k]] + query(r[k] , p);
}
void clear(int k)
{if(!k) return;clear(l[k]) , clear(r[k]) , l[k] = r[k] = vp[k] = tag[k] = wk[k] = wb[k] = ws[k] = sk[k] = sb[k] = ss[k] = 0;
}
int main()
{int n , i , pos;ll ans = 0;unsigned j;scanf("%d%*d" , &n);for(i = 1 ; i <= n ; i ++ ) scanf("%d" , &a[i]) , v[++a[i]].push_back(i);for(i = 1 ; i <= n ; i ++ ) v[i].push_back(n + 1);for(i = 1 ; i <= n ; i ++ ){pos = 0;for(j = 0 ; j < v[i].size() ; j ++ ){ans += query(root , v[i][j] - 1) - query(root , pos - 1);add(root , 2);insert(root , v[i][j] + 1 , -1 , v[i][j] + 1) , insert(root , pos + 1 , 1 , -pos - 1);pos = v[i][j];}clear(root) , root = tot = 0;}printf("%lld\n" , ans);return 0;
}