#include <cstdio>
#include <algorithm>
#include <iostream>

const int N = int(1e5) + 1;

int n, k;
int ai;
int a[N];
int p[N];
long long ans;

bool comp(int x, int y)
{
	return a[x] < a[y];
}

int main()
{
	freopen("input.txt", "rt", stdin);
	freopen("output.txt", "wt", stdout);

	scanf("%d%d", &n, &k);

	for (int i = 0; i < n; i++)
	{
		scanf("%d", &ai);

		a[ai - 1]++;
	}

	for (int i = 0; i < k; i++)
		p[i] = i;

	std::sort(p, p + k, comp);

	int sum = n;

	for (int i = 0; i < k; i++)
	{
		ans += sum;
		sum -= a[p[i]];
	}

	std::cout << ans;

	return 0;
}