Problem:
Score : 600 points

Problem 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.

Constraints

All values in input are integers.

1 \leq N \leq 200

1 \leq S_i, X \leq 10^{5}

S_i are pairwise distinct.

Input

Input is given from Standard Input in the following format:

N X
S_1 S_2 \ldots S_{N}

Output

Print the answer.

Sample Input 1

2 19
3 7

Sample Output 1

3

There are two possible orders in which we remove the numbers from S.

If we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \rightarrow 1 \rightarrow 1.

If we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \rightarrow 5 \rightarrow 2.

The output should be the sum of these: 3.

Sample Input 2

5 82
22 11 6 5 13

Sample Output 2

288

Sample Input 3

10 100000
50000 50001 50002 50003 50004 50005 50006 50007 50008 50009

Sample Output 3

279669259

Be sure to compute the sum modulo 10^{9}+7.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.*;
import java.util.*;

public class Main {
    private static final long MOD = 1_000_000_007;

    public static void main(String[] args) {
        try (CustomReader in = new CustomReader()) {
            new Main().execute(in);
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    public void execute(CustomReader in) throws IOException {
        long[] nx = in.readLineAsLongArray();
        final int N = (int)nx[0];
        long X = nx[1];
        long[] S = in.readLineAsLongArray();
        Arrays.sort(S);
        System.out.println(countNumbers(S, X));
    }

    private long countNumbers(long[] arr, long x) {
        if (x == 0) {
            return 0L;
        } else if (arr.length == 1) {
            return x % arr[0];
        }
        long count = 0L;
        int small = 0;
        int large = 0;
        boolean eq = false;
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] < x) {
                small++;
            } else if (arr[i] == x) {
                eq = true;
            }
            if (arr[i] > x) {
                large++;
            }
        }
        if (eq) {
            return 0;
        }

        if (large > 0) {
            count = (long) x;
            for (int i = 1; i <= large; i++) {
                count = (count * i) % MOD;
            }
        }

        for (int i = 0; i < small; i++) {
            long r = x % arr[i];
            if (r > 0) {
                count = (count + countNumbers(copyAndRemove(arr, 0, small, i), r)) % MOD;
            }
        }
        return count % MOD;
    }

    private long[] copyAndRemove(long[] arr, int start, int end, int removeIndex) {
        long[] copyArray = new long[end - start - 1];
        int j = 0;
        for (int i = start; i < end; i++) {
            if (i == removeIndex) {
                continue;
            }
            copyArray[j++] = arr[i];
        }
        return copyArray;
    }

    static class CustomReader extends BufferedReader {

        private static final int DEFAULT_BUF_SIZE = 2048;
        // private static final int DEFAULT_BUF_SIZE = 4096;
        // private static final int DEFAULT_BUF_SIZE = 8192;
        //private static final int DEFAULT_BUF_SIZE = 16384;
        // private static final int DEFAULT_BUF_SIZE = 1048576;

        public CustomReader() throws IOException {
            super(new InputStreamReader(System.in), DEFAULT_BUF_SIZE);
        }

        public int readLineAsInt() throws IOException {
            return Integer.parseInt(readLine());
        }

        public long[] readLineAsLongArray() throws IOException {
            String[] strArray = this.readLine().split(" ");
            long[] intArray = new long[strArray.length];
            for (int i = 0, n = strArray.length; i < n; i++) {
                intArray[i] = Long.parseLong(strArray[i]);
            }
            return intArray;
        }

    }
}