import java.math.BigInteger
import java.util.*
import javax.swing.plaf.SeparatorUI
import kotlin.math.ceil
import java.util.Queue as Queue1

fun main(args:Array<String>) {
    solve()
}

fun solve(){
    val (n,k) = readLine()!!.split(" ").map{it.toInt()}.toIntArray()
    val a = readLine()!!.split(" ").map{it.toInt()}.toIntArray()
    val s = HashSet<BigInteger>()
    for(mask in 0 until (1 shl n)){
        var sum = 0
        var sum2 = 1.toBigInteger()
        var cnt = 0
        for(i in 0 until n){
            if((mask shr i) and 1 == 1){
                sum += a[i]
                sum2 *= a[i].toBigInteger()
                cnt++
            }
        }
        if(cnt >= k){
            s.add(sum.toBigInteger())
            s.add(sum2)
        }
    }
    println(s.size)
}