import Data.Map.Strict ((!))
import qualified Data.Map.Strict as A

main :: IO ()
main = do
    [n, a] <- map read . words  <$> getLine :: IO [Int]
    ns <- map read . words  <$> getLine :: IO [Int]
    print $ dp a n ns

dp :: Int -> Int -> [Int] -> Int
dp a n ns' = sum [memo!(j, k)|j<-[1..n], k<-[0..50*n], mod k j == 0, div k j == a] 
    where
    ns = A.fromList [(i,x)|(i,x) <- zip [1..] ns']
    memo = dpIter 0 A.empty
    dpIter :: Int -> A.Map (Int, Int) Int -> A.Map (Int, Int) Int
    dpIter i memo
        | i <  n = dpIter (i+1) $ A.fromList [((j,k), f i j k)|j<-[0..n], k<-[0..50*n]]
        | i == n =                A.fromList [((j,k), f i j k)|j<-[0..n], k<-[0..50*n]]
        where
        -- f (nsのインデックス) (使う枚数) (値) = 何組あるか
        f 0 0 0 = 1
        f 0 _ _ = 0
        f i j k 
            | j>0 && k-(ns!i) >= 0 = (memo!(j,k)) + (memo!(j-1,k - ns!i))
            | otherwise            = memo!(j,k)