#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
const long long MOD = 1000000007;
template <int M, bool IsPrime = false>
class Modulo {
  int n;
  static typename std::enable_if<IsPrime, long long>::type inv(long long a,
                                                               long long p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
  }

 public:
  Modulo() : n(0) { ; }
  Modulo(int m) : n(m) {
    if (n >= M)
      n %= M;
    else if (n < 0)
      n = (n % M + M) % M;
  }
  Modulo(long long m) {
    if (m >= M)
      m %= M;
    else if (m < 0)
      m = (m % M + M) % M;
    n = m;
  }
  explicit operator int() const { return n; }
  explicit operator long long() const { return n; }
  bool operator==(const Modulo &a) const { return n == a.n; }
  Modulo &operator+=(const Modulo &a) {
    n += a.n;
    if (n >= M) n -= M;
    return *this;
  }
  Modulo &operator-=(const Modulo &a) {
    n -= a.n;
    if (n < 0) n += M;
    return *this;
  }
  Modulo &operator*=(const Modulo &a) {
    n = (long long(n) * a.n) % M;
    return *this;
  }
  Modulo operator+(const Modulo &a) const {
    Modulo res = *this;
    return res += a;
  }
  Modulo operator-(const Modulo &a) const {
    Modulo res = *this;
    return res -= a;
  }
  Modulo operator-() const { return Modulo(0) - *this; }
  Modulo operator*(const Modulo &a) const {
    Modulo res = *this;
    return res *= a;
  }
  Modulo operator^(long long m) const {
    if (m == 0) return Modulo(1);
    const Modulo a = *this;
    Modulo res = (a * a) ^ (m / 2);
    return m % 2 ? res * a : res;
  }
  typename std::enable_if<IsPrime, Modulo>::type operator/(
      const Modulo &a) const {
    return *this * inv(long long(a), M);
  }
  typename std::enable_if<IsPrime, Modulo>::type operator/=(const Modulo &a) {
    return *this *= inv(long long(a), M);
  }
  friend bool is_zero(const Modulo &x) { return int(x) == 0; }
  friend int abs(const Modulo &x) { return int(x); }
  static Modulo fact(int n, bool sw = true) {
    static std::vector<Modulo> v1 = {1}, v2 = {1};
    if (n >= (int)v1.size()) {
      const int from = v1.size(), to = n + 1024;
      v1.reserve(to);
      v2.reserve(to);
      for (int i = from; i < to; ++i) {
        v1.push_back(v1.back() * Modulo<M, true>(i));
        v2.push_back(v2.back() / Modulo<M, true>(i));
      }
    }
    return sw ? v1[n] : v2[n];
  }
  static Modulo comb(int a, int b) {
    if (b < 0 || b > a) return 0;
    return Modulo::fact(a, true) * Modulo::fact(b, false) *
           Modulo::fact(a - b, false);
  }
};
map<int, Modulo<1000000007, true> > dp[201];
void solve(long long N, long long X, std::vector<long long> S) {
  sort(S.rbegin(), S.rend());
  dp[0][X] = 1;
  for (int i = 0; i < N; i++) {
    for (auto u : dp[i]) {
      Modulo<1000000007, true> p = Modulo<1000000007, true>(1) / (N - i);
      dp[i + 1][u.first % S[i]] += p * u.second;
      dp[i + 1][u.first] += (Modulo<1000000007, true>(1) - p) * u.second;
    }
  }
  Modulo<1000000007, true> ans = 0;
  for (auto p : dp[N]) {
    ans += p.second * p.first;
  }
  cout << (int)(ans * Modulo<1000000007, true>::fact(N)) << endl;
}
void solve2(long long N, long long X, std::vector<long long> S) {
  sort(S.begin(), S.end());
  int ans = 0;
  do {
    int x = X;
    for (int i = 0; i < N; i++) {
      x %= S[i];
    }
    for (int i = 0; i < N; i++) {
      cout << S[i] << " ";
    }
    cout << " = " << x << endl;
    ans += x;
    ans %= MOD;
  } while (next_permutation(S.begin(), S.end()));
  cout << ans << endl;
}
int main() {
  long long N;
  scanf("%lld", &N);
  long long X;
  scanf("%lld", &X);
  std::vector<long long> S(N);
  for (int i = 0; i < N; i++) {
    scanf("%lld", &S[i]);
  }
  solve(N, X, std::move(S));
  return 0;
}
