#![allow(non_snake_case, unused)]
use std::cmp::*;
use std::collections::*;
use std::f64::consts::*;

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

fn main() {
    input!{
        n: usize,
        a: i64,
        mut x: [i64; n],
    }
    let X_max = *x.iter().max().unwrap();
    for i in 0..n {
        x[i] -= a;
    }
    let mut dp = vec![vec![0i64; 5000]; 51];
    
    for j in 0..n+1 {
        for t in 0.. 2 * n * X_max as usize + 1 {
            if j == 0 && t == n * (X_max as usize) {
                dp[j][t] = 1;
            } else if j >= 1 && (t as i64 - x[j-1] < 0 || t as i64 - x[j-1] > (2 * n * (X_max as usize)) as i64) {
                dp[j][t] = max(dp[j][t], dp[j-1][t])
            } else if j >= 1 && 0 <= t as i64 - x[j-1] && t as i64- x[j-1] <= (2 * n * (X_max as usize)) as i64 {
                dp[j][t] = max(dp[j][t], dp[j-1][t] + dp[j-1][(t as i64-x[j-1]) as usize])
            } else {
                dp[j][t] = 0
            }
        }
    }

    println!("{}", max(dp[n][n*X_max as usize]-1, 0));
}
