#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;

ll mod=1e9+7;
ll fac[210];

void modfac(ll n){
    fac[0]=1;
    for(ll i=1;i<n;i++){
        fac[i]=(fac[i-1]*i)%mod;
    }
}

ll modinv(ll a){
    ll b=mod,u=1,v=0;
    while(b){
        ll t=a/b;
        a-=t*b; swap(a,b);
        u-=t*v; swap(u,v);
        }
        u%=mod;
        if(u<0) u+=mod;
    return u;
}

ll dp[210][100010];

int main(){
  ll n,x;
  cin >> n >> x;
  ll a[n];
  for(ll i=0;i<n;i++) cin >> a[i];
  sort(a,a+n);
  reverse(a,a+n);
  ll inv[n+1];
  for(ll i=1;i<=n;i++) inv[i]=modinv(i);
  for(ll i=0;i<=x;i++) dp[n][i]=i;
  for(ll i=n-1;i>=0;i--){
    for(ll j=0;j<=x;j++){
      ll p=n-i;
      dp[i][j]=inv[p]*(dp[i+1][j%a[i]]+(p-1)*dp[i+1][j]%mod)%mod;
    }
  }
  modfac(210);
  cout << dp[0][x]*fac[n]%mod << endl;
}
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <numeric>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline bool Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
    for (auto i = first;i != last;i++){
        cin >> (*i);
    }
}
template<class itr> void array_output(itr start,itr goal){
    string ans = "";
    for (auto i = start;i != goal;i++) ans += to_string(*i)+" ";
    if (!ans.empty()) ans.pop_back();
    PRINT(ans);
}
ll gcd(ll a, ll b) {
    return a ? gcd(b%a,a) : b;
}
const ll INF = 1e17;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 200005;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < MAX; 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;
    }
}

ll COM(ll n, ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,m,k;
    cin >> n >> m >> k;
    ll ans = 0;
    COMinit();
    rep(i,n){
        rep(j,m-1){
            ans += (j+1)*n*(m-j-1)%MOD;
            ans %= MOD;
        }
    }
    rep(i,n-1){
        rep(j,m){
            ans += (i+1)*m*(n-i-1)%MOD;
            ans %= MOD;
        }
    }
    PRINT(ans*COM(n*m-2,k-2)%MOD);
}
