#include<bits/stdc++.h>
#define rep(i, s, n) for (long long i=s;i<(long long)(n);i++)
using ll=long long;
using namespace std;
int main(){
    int n,k;
    cin>>n>>k;
    assert(n<=18);
    assert(2<=n);
    assert(k<=n);
    int cnt=0;
    int a[30];
    int i=0;
    int p;
    while(cin>>p){
        assert(p<=1000);
        a[i]=p;
        cnt++;
        i++;
    }
    assert(cnt==n);
  set<ll>s;
    rep(i,(1<<k)-1,(1<<n)){
        ll sum=0,cnt=0,pro=1;
        rep(j,0,n){
            if((1<<j)&i){
                cnt++;
                sum+=a[j];
                pro*=a[j];
            }
        }
        if(cnt>=k){
            s.insert(sum);
            s.insert(pro);
        }
    }
    cout<<s.size()<<endl;
}