#include <iostream>
#include <algorithm>
#include <vector>
using namespace std ;
using ll = long long ;
const int MAXP = 64 ;
ll a[MAXP][MAXP][MAXP] ;
int main() {
   int n, cnt ;
   cin >> n >> cnt ;
   vector<ll> v(n) ;
   for (auto &vv :v)
      cin >> vv ;
   sort(v.begin(), v.end()) ;
   for (int i=0; i<n; i++) {
      a[i][i][1] = 1 ;
      for (int j=0; j<i; j++)
         for (int k=j; k<i; k++)
            for (int cnt=1; cnt<=i+1; cnt++)
               if (cnt < 2 || v[i] <= v[j] + v[k])
                  a[k][i][cnt+1] += a[j][k][cnt] ;
   }
   ll r = 0 ;
   for (int i=0; i<n; i++)
      for (int k=i; k<n; k++)
         r += a[i][k][cnt] ;
   cout << r << endl ;
}