#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev            coyhhhhhhyoc    
#define next          sdNNNmNNNNNNNmds  
#define y0           hNNNNy_yNNNNNN_sNh
#define y1          mNNNNNdtdNNNNNNtsNNm
#define yn          mNNNNNNNNy___smNNNms
#define tm            oooooosyysooooot 
#define read               tyhyt        
#define rank              ytmNmo         
#define index              yyy
#define pb push_back
#define pcnt __builtin_popcountll
#define rrep(i,a,b) for(int i = (b); i >= (a); i--)
#define rall(x,a) for(auto x : a)
#define MOD 1000000007
#define MODD 1224479 
#define endl "\n"
#define int long long
typedef long long ll;
using namespace std;

const int N = 22;
int a[N];
int n, k;

int solve() {
    set<pair<int, int> > st;
    cin >> n >> k;
    rep(i, 1, n) {
        cin >> a[i];
    }
    rep(mask, 0, (1 << n) - 1) {
        if(pcnt(mask) < k) continue;
        int sum = 0, summ = 0;
        int pro = 1, proo = 1;
        rep(i, 1, n) {
            if(mask & (1 << (i - 1))) {
                sum = (sum + a[i]) % MOD;
                summ = (summ + a[i]) % MODD;
                pro = (pro * a[i]) % MOD;
                proo = (proo * a[i]) % MODD;
            }
        }
        st.insert({sum, summ});
        st.insert({pro, proo});
    }
    int ans = sz(st);
    cout << ans << endl;
    return 0;
}
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    while(t--) {
        solve();
    }
    return 0;
}