#define sz(x) ((int)size(x))

int A[20];
{
	ll @N, @K;
	rd(A(N));
	ll U = 1LL << N;
	set<ll> st;
	rep(bit, U) {
		if(__builtin_popcount(bit) >= K) {
			ll mul = 1, sum = 0;
			rep(i, N) {
				if(bit >> i & 1) sum += A[i], mul *= A[i];
			}
			st.insert(sum), st.insert(mul);
		}
	}
	wt(sz(st));
}