#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int n, q;
cin >> n >> q;
using VI = vector<int>;
VI A(n), cnt;
map<int, int> M;
for (int &a : A) cin >> a, M[a] = 0;
int id = 0, k = M.size();
for (auto &p : M) p.second = id++;
cnt.resize(k);
for (int &a : A) a = M[a], ++cnt[a];
int L, R;
cin >> L >> R;
assert(q == 1 && L == 1 && R == n);
ll ans = 0;
for (int c : cnt) ans += (ll)c * (c + 1) / 2 + (ll)c * (n - c);
sort(cnt.begin(), cnt.end());
ll l = 0, r = 0, where = 1;
for (int c : cnt) {
if (where)
ans += l * (n - c - l), l += c;
else
ans += r * (n - c - r), r += c;
where ^= 1;
}
cout << ans << '\n';
return 0;
}
