#include <bits/stdc++.h>
using namespace std;
#define FINISH cerr << "FINISH" << endl;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
#define fir first
#define sec second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int N = 200020;
int dp[55][20][55];
void solve()
{
	int n, kk;
	cin >> n >> kk;
	vector<int> a(n + 1, 0);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j < i; j++) {
			dp[i][2][j] = 1;
		}
	}
	sort(next(a.begin()), a.end());
	for (int i = 3; i <= n; i++) {
		for (int j = 3; j <= min(kk, i); j++) {
			// debug(j);
			for (int k = 1; k < i; k++) {
				// cout << "IJK" << i << " " << j << " " << k << endl;
				for (int l = 1; l < k; l++) {
					if (a[l] + a[k] >= a[i]) {
						// cout << "FIND  " << l << " " << k << " " << i <<
						// endl;
						dp[i][j][k] += dp[k][j - 1][l];
					}
				}
			}
			// cout << endl;
		}
	}
	/*for (int i = 3; i <= n; i++) {
		for (int j = 1; j < i; j++) {
			for (int k = 1; k < j; k++) {
				if(a[k]+a[j])
			}
		}
	}*/
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j < i; j++) {
			ans += dp[i][kk][j];
		}
	}
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}