output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N X
      S_1 S_2 \ldots S_{N}
attempt: n, x = map(int, input().split())
  s, f, M = sorted(list(map(int, input().split())))[::-1], [1, 1], 10**9 + 7
  for i in range(2, n):
      f += [f[-1] * i % M]
  D = {x: f[n - 1]}
  for i, k in enumerate(s):
      m, inv = dict(), pow(n - i - 1, M - 2, M)
      for j, a in D.items():
          m[j % k] = m.get(j % k, 0) + a
      for j, a in m.items():
          D[j] = (D.get(j, 0) + a * inv) % M
  print(sum([i * j for i, j in m.items()]) % M)
  
problem_description: Statement
  
  Snuke has a blackboard and a set S consisting of N integers. The i-th element
  in S is S_i.
  
  He wrote an integer X on the blackboard, then performed the following
  operation N times:
  
    * Choose one element from S and remove it.
    * Let x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \bmod {y}.
  
  There are N! possible orders in which the elements are removed from S. For
  each of them, find the number that would be written on the blackboard after
  the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.
samples: [{"input": "2 19\n    3 7", "output": "3\n    \n\n  * There are two possible orders in which we remove the numbers from S.\n  * If we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n  * If we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n  * The output should be the sum of these: 3.\n\n* * *"}, {"input": "5 82\n    22 11 6 5 13", "output": "288\n    \n\n* * *"}, {"input": "10 100000\n    50000 50001 50002 50003 50004 50005 50006 50007 50008 50009", "output": "279669259\n    \n\n  * Be sure to compute the sum modulo 10^{9}+7."}]