#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    vector<int> mod = {1000000007, 1000000009, 1000000021, 1000000033, 1012924417, 1224736769};

    int N, K; cin >> N >> K;

    vector<ll> A(N);
    rep(i, N) cin >> A[i];

    vector<vector<ll>> res;

    rep(i, 1<<N){
        if(__builtin_popcount(i) < K) continue;

        vector<ll> a, b;

        rep(k, 6){
            ll x = 0, y = 1;
            rep(j, N){
                if((i>>j)&1){
                    x += A[j], y *= A[j];
                    x %= mod[k], y %= mod[k];
                }
            }
            a.eb(x), b.eb(y);
        }

        res.eb(a), res.eb(b);
    }

    sort(all(res));

    int ans = 1;
    rep(i, sz(res)-1){
        if(res[i] != res[i+1]) ans++;
    }

    cout << ans << '\n';
}