#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100, K = 12;
unsigned long long n, k, ans, a[N], dp[N][K], fen[N][K];
void add(int dex, int cnt, unsigned long long val) {
  for (; dex < N; dex += dex & -dex) fen[dex][cnt] += val;
}
unsigned long long sum(int dex, int cnt) {
  return (dex ? fen[dex][cnt] + sum(dex - (dex & -dex), cnt) : 0);
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n >> k;
  k++;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int dex = 0; dex < n; dex++)
    for (int cnt = 1; cnt < K; cnt++) {
      dp[dex][cnt] = (cnt == 1 ? 1 : sum(a[dex] - 1, cnt - 1));
      add(a[dex], cnt, dp[dex][cnt]);
    }
  for (int i = 0; i < n; i++) ans += dp[i][k];
  cout << ans;
  return 0;
}
