#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
bool be;
constexpr int N = 1e5 + 5;
int n, q, a[N], pos[N], b[N], ans[N], stk[N], top, nxt[N];
struct b1t {
	int t[N];
	inline void add(int u, int v)
	{
		while (u <= n) {
			t[u] += v;
			u += u & -u;
		}
	}
	inline int query(int u)
	{
		int res = 0;
		while (u) {
			res += t[u];
			u -= u & -u;
		}
		return res;
	}
}t;
ll solve()
{
	ll ans = n;
	for (int i = 1; i; i = nxt[i]) {
		ans += b[i];
	}
	return ans;
}
bool en;
int main()
{
	cerr << (&be - &en) / 1024.0 / 1024 << " MB\n--------------------------------" << endl;
#ifdef IAKIOI
	freopen("in.in", "r", stdin);
//	freopen("out.out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> q;
	for (int i = 1; i <= n; ++i) cin >> a[i], pos[a[i]] = i;
	for (int i = 1; i <= n; ++i) {
		b[i] = pos[i] - t.query(pos[i]) - 1;
		t.add(pos[i], 1);
	}
	int mn = n + 1;
	for (int i = n; i >= 1; --i) {
		if (i < n) nxt[a[i]] = mn;
		mn = min(mn, a[i]);
	}
	cout << solve() << ' ';
//	while (q--) {
//		int x;
//		cin >> x;
//		cout << ans[x] << '\n';
//	}
	return 0;
}