#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

template<int MOD>
class ModInt {
public:
    ModInt() :value(0) {}
    ModInt(long long val) :value((int)(val<0 ? MOD + val % MOD : val % MOD)) { }

    ModInt& operator+=(ModInt that) {
        value = value + that.value;
        if (value >= MOD)value -= MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that) {
        value -= that.value;
        if (value<0)value += MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that) {
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that) {
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const {
        return ModInt(*this) += that;
    }
    ModInt operator-(ModInt that) const {
        return ModInt(*this) -= that;
    }
    ModInt operator*(ModInt that) const {
        return ModInt(*this) *= that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const {
        ModInt n = *this, res = 1;
        while (k) {
            if (k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const { return value; }

private:
    int value;
};
typedef ModInt<1000000007> mint;
ostream& operator<<(ostream& os, const mint& x) {
    os << x.toi();
    return os;
}

class Combinatons {
public:
    Combinatons(int n = 0) :fact(n + 1), rev(n + 1) {
        fact[0] = 1;
        for (int i = 1; i < n + 1; ++i)fact[i] = fact[i - 1] * i;
        for (int i = 0; i < n + 1; ++i)rev[i] = fact[i].inverse();
    }

    mint C(int n, int r) {
        if (n < r)return 0;
        return fact[n] * rev[r] * rev[n - r];
    }

    mint H(int n, int r) {
        return C(n + r - 1, r);
    }

    mint P(int n, int r) {
        if (r > n)return 0;
        return fact[n] * rev[n - r];
    }

    mint catalan(int n) {
        return fact[2 * n] * rev[n + 1] * rev[n];
    }

private:
    vector<mint> fact, rev;
};

void solve() {
    int N, X;
    cin >> N >> X;
    int M = 0, K = 0;
    Combinatons comb(100005);

    vi cnt(X + 1);
    vi S;
    rep(i, N) {
        int a;
        cin >> a;
        if (a > X) {
            K++;
        } else {
            M++;
            S.push_back(a);
            cnt[a]++;
        }
    }

    sort(all(S));
    rep(i, X) {
        cnt[i + 1] += cnt[i];
    }

    vector<mint> dp(X + 1);
    dp[X] = comb.P(N, K);

    if (S.empty()) {
        cout << dp[X] << endl;
        return;
    }

    for (int x = X; x > 0; --x) {
        each(y, S) {
            if (y > x) {
                break;
            }
            int nx = x % y;
            int a = cnt[x] - 1;
            int b = cnt[x] - cnt[nx] - 1;
            dp[nx] += dp[x] * comb.P(a, b);
        }
    }

    mint ans;
    rep(i, S[0])ans += dp[i] * i;
    cout << ans << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}

Measured memory_bytes: 1792