// https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_d
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

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

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

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

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

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

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

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

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

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

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

const MOD: i64 = 1e9 as i64 + 7;

fn main() {
    input! {
        n: usize, x: usize,
        mut s: [usize; n]
    };
    s.sort();

    let mut table = vec![0usize; 100010];
    for i in 0..n {
        table[s[i]+1] += 1;
    }
    for i in 1..100010 {
        table[i] += table[i-1];
    }

    let mut visited = vec![false; 100010];
    let mut que = BinaryHeap::new();
    que.push(x);
    visited[x] = true;
    let mut dp = dvec!(0i64; 100010, n+1);
    dp[x][n-table[x+1]] = 1;

    while let Some(x) = que.pop() {
        for l in (0..n+1).rev() {
            if dp[x][l] == 0 {
                continue;
            }
            let base = dp[x][l];
            if l >= 1 {
                dp[x][l-1] += (base * (l as i64)) % MOD;
                dp[x][l-1] %= MOD;
            }
            for i in 0..n {
                if x < s[i] {
                    break;
                }
                let tx = x % s[i];
                if !visited[tx] {
                    visited[tx] = true;
                    que.push(tx);
                }
                let sum = table[x+1] - table[tx+1] - 1;
                dp[tx][l+sum] += base;
                dp[tx][l+sum] %= MOD;
            }
        }
    }
    // debug!(dp[0], dp[1], dp[2]);
    let mut total = 0;
    for i in 0..s[0] {
        total += dp[i][0] * (i as i64) % MOD;
    }
    println!("{}", total % MOD);
}


Measured memory_bytes: 188668