#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

const ll mod = 1000000000+7;
void add(ll &a, ll b) { (a += b) %= mod; }
void mul(ll &a, ll b) { (a *= b) %= mod; }

void solve() {
    ll n, k;
    cin >> n >> k;
    vector<ll> a(n);
    rep(i, 0, n) cin >> a[i];
    set<ll> st;
    rep(bit, 0, (1<<n)) {
        if(__builtin_popcount(bit) < k) continue;
        ll x = 0, y = 1;
        rep(i, 0, n) if(bit & (1<<i)) add(x, a[i]);
        rep(i, 0, n) if(bit & (1<<i)) mul(y, a[i]);
        st.insert(x);
        st.insert(y);
    }
    cout << st.size() << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}