#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

int mod = 1000000007;

ll calc(int x, set<int>& s) {
  if (s.empty()) {
    return x;
  }
  auto s_ = s;
  ll ans = 0;
  for (int elm : s) {
    s_.erase(elm);
    ans = (ans + calc(x % elm, s_)) % mod;
    s_.insert(elm);
  }
  return ans;
}

ll po(ll k, ll x) {
  if (x == 0) {
    return 1;
  }
  if (x == 1) {
    return k % mod;
  }
  ll y = po(k, x/2);
  y = y * y % mod;
  if (x % 2 == 1) {
    y = y * k % mod;
  }
  return y;
}

int n;
vi s;
vvll dp;
vll frac, finv;
ll solve(int m, int x) {
  if (dp[m][x] >= 0) {
    return dp[m][x];
  }
  if (m == 0) {
    dp[m][x] = x;
    return x;
  }
  ll ret = 0;
  rep (i, m) {
    ret = (ret + solve(i, x % s[i]) * frac[m-1] % mod * finv[i] % mod) % mod;
  }
  dp[m][x] = ret;
  return ret;
}

int main() {
  int x;
  scan(n, x);
  s.resize(n);
  scan(s);
  sort(all(s));

  int n_max = x + 1;
  frac.resize(n_max);
  finv.resize(n_max);
  frac[0] = 1;
  finv[0] = 1;
  FOR (i, 1, n_max) {
    frac[i] = frac[i-1] * i % mod;
    finv[i] = po(frac[i], mod-2);
  }
  dp.assign(n+1, vll(n_max, 0));
  vvll accum = dp;
  rep (j, n_max) {
    dp[0][j] = j;
  }
  FOR (i, 1, n+1) {
    rep (j, n_max) {
      accum[i][j] = (accum[i-1][j] + dp[i-1][j % s[i-1]] * finv[i-1]) % mod;
    }
    rep (j, n_max) {
      dp[i][j] = accum[i][j] * frac[i-1] % mod;
    }
  }
  print(dp[n][x]);

  return 0;
}


Measured memory_bytes: 316400