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

public class Main {
    static int[] values;
    static int[][] matrix;
    static int[][] dp;
    static final int MOD = 998244353;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int k = sc.nextInt();
        ArrayList<Integer> children = new ArrayList<>();
        for (int i = 1; i <= Math.sqrt(k); i++) {
            if (k % i == 0) {
                children.add(i);
                if (i * i < k) {
                    children.add(k / i);
                }
            }
        }
        Collections.sort(children);
        int size = children.size();
        HashMap<Integer, Integer> compress = new HashMap<>();
        for (int i = 0; i < size; i++) {
            compress.put(children.get(i), i);
        }
        matrix = new int[size][size];
        for (int i = 0; i < size; i++) {
            for (int j = 0; j < size; j++) {
                matrix[i][j] = compress.get(children.get(i) / getGCD(children.get(i), children.get(j)));
            }
        }
        values = new int[n];
        for (int i = 0; i < n; i++) {
            values[i] = compress.get(getGCD(k, sc.nextLong()));
        }
        dp = new int[size][n];
        for (int[] arr : dp) {
            Arrays.fill(arr, -1);
        }
        System.out.println(dfw(n - 1, size - 1));
    }
    
    static int dfw(int idx, int v) {
        if (v == 0) {
            return pow(2, idx + 1);
        }
        if (idx < 0) {
            return 0;
        }
        if (dp[v][idx] < 0) {
            dp[v][idx] = (dfw(idx - 1, v) + dfw(idx - 1, matrix[v][values[idx]])) % MOD;
        }
        return dp[v][idx];
    }
    
    static int getGCD(long x, long y) {
        if (y == 0) {
            return (int)x;
        } else {
            return getGCD(y, x % y);
        }
    }
    
    static int pow(long x, int p) {
        if (p == 0) {
            return 1;
        } else if (p % 2 == 0) {
            return pow(x * x % MOD, p / 2);
        } else {
            return (int)(pow(x, p - 1) * x % MOD);
        }
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}