#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

using A = __int128_t;
int main() {
    int n, k;
    cin >> n >> k;
    vector<int> v(n);
    for (auto &&i : v) scanf("%d", &i);
    set<A> s;
    for (int i = 0; i < (1 << n); ++i) {
        if(__builtin_popcount(i) < k) continue;
        A x = 1, y = 0;
        for (int j = 0; j < n; ++j) {
            if(i & (1 << j)){
                x *= v[j];
                y += v[j];
            }
        }
        s.emplace(x);
        s.emplace(y);
    }
    cout << s.size() << "\n";
    return 0;
}