#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=55;
int n,m,a[N];
ll dp[N][N][20],ans;
int main() {
	scanf("%d%d",&n,&m);
	rep(i,1,n+1) scanf("%d",a+i);
	sort(a+1,a+n+1);
	rep(i,1,n+1) rep(j,1,i) {
		dp[i][j][2]++;
		rep(pj,1,j) if (a[pj]+a[j]>=a[i]) rep(v,2,m)
			dp[i][j][v+1]+=dp[j][pj][v];
		ans+=dp[i][j][m];
	}
	printf("%lld\n",ans);
}