#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

class Combination{
public:
  typedef long long ll;
  ll N;
  ll mod;
  vector<ll> fac;
  vector<ll> finv;
  vector<ll> inv;
  
  
  Combination(ll N = 1e3,ll mod = 1e9 + 7): N(N), mod(mod), fac(N+1), finv(N+1), inv(N+1){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(Int i = 2; i <= N; i++){
      fac[i] = fac[i-1] * i % mod;
      inv[i] = mod - inv[mod%i] * (mod / i) % mod;
      finv[i] = finv[i-1] * inv[i] % mod;
    }
  }

  function<ll(ll,ll)> get = [&](ll n,ll r){
    if( n < r ) return 0LL;
    if( n < 0 || r < 0) return 0LL;
    return fac[n] * (finv[r] * finv[n-r] % mod) % mod;
  };

};
auto com = Combination();
auto nCr = com.get;

Int N;
vector<Int> S;
_int mem[210][100010], used[210][100010];

Int calc(Int n, Int cnt1, Int cnt2){
  static _int used[210][210][210], mem[210][210][210];
  Int a = 0, b = 0;
  if(n == 0) return 1;
  if(used[n][cnt1][cnt2]++) return mem[n][cnt1][cnt2];
  
  if(cnt1) a = calc(n - 1, cnt1 - 1, cnt2) * cnt1 % mod;
  b = nCr(n - 1, cnt1 + cnt2) * com.fac[cnt1 + cnt2];
  
  Int res = (a + b) % mod;
  return mem[n][cnt1][cnt2] = res;
}

Int dfs(Int i, Int x){

  if(i == N) return x;
  if(x == 0) return x;
  if(used[i][x]++) return mem[i][x];
  if(x < S[N-1]) return mem[i][x] =  x * com.fac[N-i] % mod;
  if(x == S[N-1]) return mem[i][x] =  0;

  Int cnt = 0;
  Int j = i;
  while(j < N && x < S[j]) j++, cnt++;
  
  Int res = 0;
  for(;j<N;j++){
    Int a = dfs(j+1, x % S[j]);
    //Int b = nCr(N - i - 1, j - i);
    //Int c = com.fac[j - i];
    res = res + a * calc(N - i, cnt, (j - i) - cnt);
    //pr(j, i, x, S[j], dfs(j+1, x % S[j]), nCr(N - i - 1, j - i));
    res %= mod;
  }
  return mem[i][x] = res;
}

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int X;
  cin>>N>>X;
  S.resize(N);
  cin>>S;
  sort(S.begin(), S.end(), greater<Int>());
  //pr(S);
  Int ans = dfs(0, X);
  cout<<ans<<endl;

  
  
  return 0;
}


Measured memory_bytes: 227712