#include<bits/stdc++.h>
using namespace std;
using u64 = uint_least64_t;
using s64 = int_least64_t;
using ll = uint_least64_t;

void recursive_comb(vector<int> &indexes, int s, int rest, vector<vector<int>> &com) {
    if (rest == 0) {
        vector<int> v;
        for (int i = 0; i < indexes.size(); i++){
            v.push_back(indexes[i]);
        }
        com.push_back(v);
        // cout << "out(rest==0)" << endl;
    } 
    else {
        if (s < 0) {
            return;
        }
        recursive_comb(indexes, s - 1, rest, com);
        indexes[rest - 1] = s;
        recursive_comb(indexes, s - 1, rest - 1, com);
    }
}

// nCkの組み合わせに対して処理を実行する
void foreach_comb(int n, int k, vector<int> &indexes, vector<vector<int>> &com) {
    recursive_comb(indexes, n - 1, k, com);
}

int main(){
	u64 n,k ;
    vector<vector<int>> com;
    vector<int> indexes;
    vector<u64> ans;

    cin >> n >> k;
    vector<u64> a(n);
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    for (int i = k; i <= n; i++){
        u64 sum = 0;
        u64 prd = 1;
        indexes.clear();
        com.clear();
        for (int j = 0; j < i; j++){
            indexes.push_back(j);
        }
        foreach_comb(n, i, indexes, com);

        for (int ii = 0; ii < com.size(); ii++){
            for (int jj = 0; jj < com.at(ii).size(); jj++){
                sum += a[com.at(ii).at(jj)];
                prd *= a[com.at(ii).at(jj)];
            }
            ans.push_back(sum);
            ans.push_back(prd);
            sum = 0;
            prd = 1;
        }
    }
    std::sort(ans.begin(), ans.end());
    ans.erase(std::unique(ans.begin(), ans.end()), ans.end());
    cout << ans.size() << endl;
    return 0;
}