// ---------- begin ModInt ----------
const MOD: u32 = 1_000_000_007;

#[derive(Clone, Copy)]
struct ModInt(u32);

impl std::ops::Add for ModInt {
    type Output = ModInt;
    fn add(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}

impl std::ops::AddAssign for ModInt {
    fn add_assign(&mut self, rhs: ModInt) {
        *self = *self + rhs;
    }
}

impl std::ops::Sub for ModInt {
    type Output = ModInt;
    fn sub(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + MOD - rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}

impl std::ops::SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: ModInt) {
        *self = *self - rhs;
    }
}

impl std::ops::Mul for ModInt {
    type Output = ModInt;
    fn mul(self, rhs: ModInt) -> Self::Output {
        ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as u32)
    }
}

impl std::ops::MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: ModInt) {
        *self = *self * rhs;
    }
}

impl std::ops::Neg for ModInt {
    type Output = ModInt;
    fn neg(self) -> Self::Output {
        ModInt(if self.0 == 0 {0} else {MOD - self.0})
    }
}

impl std::fmt::Display for ModInt {
    fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl std::str::FromStr for ModInt {
    type Err = std::num::ParseIntError;
    fn from_str(s: &str) -> Result<Self, Self::Err> {
        let val = s.parse::<u32>()?;
        Ok(ModInt::new(val))
    }
}

#[allow(dead_code)]
impl ModInt {
    pub fn new(n: u32) -> ModInt {
        ModInt(n % MOD)
    }
    pub fn zero() -> ModInt {
        ModInt(0)
    }
    pub fn one() -> ModInt {
        ModInt(1)
    }
    pub fn pow(self, mut n: u32) -> ModInt {
        let mut t = ModInt::one();
        let mut s = self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(self) -> ModInt {
        self.pow(MOD - 2)
    }
}
// ---------- end ModInt ----------

use std::io::Read;

fn run() {
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut it = s.trim().split_whitespace();
    let _n: usize = it.next().unwrap().parse().unwrap();
    let x: usize = it.next().unwrap().parse().unwrap();
    let mut a: Vec<usize> = it.map(|s| s.parse().unwrap()).collect();
    a.sort();
    // 区間の数, 区間の和
    let mut dp = std::collections::BTreeMap::<(usize, usize), ModInt>::new();
    dp.insert((0, 0), ModInt::one());
    for a in a.into_iter().rev() {
        let mut next = std::collections::BTreeMap::<(usize, usize), ModInt>::new();
        for (k, v) in dp.into_iter() {
            let (c, s) = k;
            if s > x {
                continue;
            }
            // 区間をinsert
            *next.entry((c + 1, s + a)).or_insert(ModInt::zero()) += v;
            // 区間に包含
            *next.entry((c, s)).or_insert(ModInt::zero()) += v * ModInt((s - c * a + c) as u32);
            // 区間を延長
            for d in 1..(a + 1) {
                *next.entry((c, s + d)).or_insert(ModInt::zero()) += v * ModInt(c as u32) * ModInt(2);
            }
            // 区間を併合
            if c > 1 {
                let way = ModInt((c * (c - 1) ) as u32);
                for d in 1..(a + 1) {
                    *next.entry((c - 1, s + d)).or_insert(ModInt::zero()) += v * way * ModInt((a - d + 1) as u32);
                }
            }
        }
        dp = next;
    }
    let mut ans = ModInt::zero();
    for (k, v) in dp.into_iter() {
        let (c, s) = k;
        if c == 1 && s == x {
            ans += v;
        }
    }
    println!("{}", ans);
}

fn main() {
    run();
}


Measured memory_bytes: 4476