mod = 998244353
R = 3
Rinv = 332748118
W = [pow(R, (mod-1)>>i, mod) for i in range(24)]
Winv = [pow(Rinv, (mod-1)>>i, mod) for i in range(24)]


def fft(k, f):
	for l in range(k, 0, -1):
		d = 1<<l-1
		U = [1]
		for i in range(d):
			U.append(U[-1]*W[l]%mod)
		for i in range(1<<k-l):
			for j in range(d):
				s = i*2*d+j
				f[s], f[s+d] = (f[s]+f[s+d])%mod, U[j]*(f[s]-f[s+d])%mod


def fftinv(k, f):
	for l in range(1, k+1):
		d = 1<<l-1
		for i in range(1<<k-l):
			u = 1
			for j in range(i*2*d, (i*2+1)*d):
				f[j+d] *= u
				f[j], f[j+d] = (f[j]+f[j+d])%mod, (f[j]-f[j+d])%mod
				u *= Winv[l]
				u %= mod


def convolution(a, b):
	le = len(a)+len(b)-1
	k = le.bit_length()
	n = 1<<k
	a = a+[0]*(n-len(a))
	b = b+[0]*(n-len(b))
	fft(k, a)
	fft(k, b)
	for i in range(n):
		a[i] *= b[i]
		a[i] %= mod
	fftinv(k, a)
	ninv = pow(n, mod-2, mod)
	for i in range(le):
		a[i] *= ninv
		a[i] %= mod
	return a[:le]


def FPSinv(H):
  I=[pow(H[0],M-2,M)]
  l=1
  while l<len(H):
    I+=[0]*l
    nI=convolution(H[:l*2],convolution(I,I)[:l*2])[:l*2]
    for i in range(l*2):
      nI[i]=(2*I[i]-nI[i])%M
    I=nI
    l*=2
  return I[:len(H)]

def FPSlog(H):
  H1=[H[i]*i%M for i in range(1,len(H))]+[0]
  H2=FPSinv(H)
  I=convolution(H1,H2)
  I=[0]+[I[i]*fb[i+1]*fa[i]%M for i in range(len(H)-1)]
  return I

def FPSexp(H):
  I=[1]
  l=1
  while l<len(H):
    I+=[0]*l
    I2=FPSlog(I)[:l*2]
    I3=H[:l*2]
    I3[0]+=1
    for i in range(l*2):
      I3[i]-=I2[i]
    nI=convolution(I,I3)[:l*2]
    I=nI
    l*=2
  return I[:len(H)]


n,K=map(int,input().split())
a=[min(K,int(x)) for x in input().split()]
M=998244353
fa=[1,1]
fb=[1,1]
for i in range(2,10**5+1):
  fa+=[fa[-1]*i%M]
  fb+=[fb[-1]*(M//i)*fb[M%i]*fa[M%i-1]*(-1)%M]
fc=lambda n,k:fa[n]*fb[k]*fb[n-k]%M if n>=k>=0 else 0
g=[0]*(K+1)
for i in range(1,K+1):
  if K%i==0:
    c=[0]*(K+1)
    for v in a:
      c[v//(K//i)]+=1
    q=[1]
    for j in range(1,K+1):
      if c[j]>0:
        q2=[1]+[fb[k] for k in range(1,j+1)]
        l=1<<(len(bin(i))-2)
        q2+=[0]*(l-len(q2))
        q2=FPSlog(q2)[:l]
        for k in range(len(q2)):
          q2[k]*=c[j]
          q2[k]%=M
        q2=FPSexp(q2)
        q=convolution(q,q2)[:i+1]
    if len(q)>=i+1:
      g[i]=q[i]*fa[i]%M
ans=0
from math import gcd
for i in range(K):
  ans+=g[gcd(i,K)]
  ans%=M
print(ans*pow(K,M-2,M)%M)