#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr); cout.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <boost/multiprecision/cpp_int.hpp>
using bint = boost::multiprecision::cpp_int;

int main() {
    int n, k; cin >> n >> k;
    auto a = vec<int>(uns, n);
    for (auto &e : a) cin >> e;

    set<bint> ints;
    for (int i = 0; i < (1 << n); ++i) {
        if (bitset<32>(i).count() < k) continue;

        bint i1 = 0, i2 = 1;
        for (int j = 0; j < n; ++j) {
            if (!(i & (1 << j))) continue;
            i1 += a[j];
            i2 *= a[j];
        }

        ints.insert(i1);
        ints.insert(i2);
    }

    cout << size(ints) << endl;
}