#pragma ide diagnostic ignored "misc-no-recursion"

#include "bits/stdc++.h"

using namespace std;
typedef long long ll;
typedef double db;
typedef complex<db> pt;

#define TESTCASE 0

static constexpr int MOD = 998'244'353;
static constexpr int INF = 1.1e9;
static constexpr int MAXN = 64;


static ll dp[MAXN][MAXN][MAXN];

static void solve([[maybe_unused]] int tc) {
    int N, K;
    cin >> N >> K;

    vector<int> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }

    sort(A.begin(), A.end());
    for (int i = 0; i < N; i++) {
        for (int j = i + 1; j < N; j++) {
            dp[2][i][j] = 1;
        }
    }

    for (int z = 3; z <= K; z++) {
        for (int i = 0; i < N; i++) {
            for (int j = i + 1; j < N; j++) {
                for (int k = j + 1; k < N; k++) {
                    if (A[i] + A[j] >= A[k]) {
                        dp[z][j][k] += dp[z - 1][i][j];
                    }
                }
            }
        }
    }

    ll res = 0;
    for (int i = 0; i < N; i++) {
        for (int j = i + 1; j < N; j++) {
            res += dp[K][i][j];
        }
    }

    cout << res << endl;
}

int main() {
    ios::sync_with_stdio(false);

    if (const char *f = getenv("REDIRECT_STDOUT"); f) {
        freopen(f, "w", stdout);
    }

    int T = 1;
#if TESTCASE
    cin >> T;
#endif

    for (int t = 1; t <= T; t++) {
        solve(t);
    }

    return 0;
}