mod=998244353
table_size=3*10**5

fac=[1]*(table_size+1)
finv=[1]*(table_size+1)

for i in range(2,table_size+1):
  fac[i]=fac[i-1]*i%mod
finv[table_size]=pow(fac[table_size],mod-2,mod)
for i in range(table_size-1,-1,-1):
  finv[i]=finv[i+1]*(i+1)%mod

def rebuild(n):
  global table_size,fac,finv
  fac+=[0]*(n-table_size)
  fac+=[0]*(n-table_size)
  finv+=[0]*(n-table_size)
  for i in range(table_size+1,n+1):
    fac[i]=fac[i-1]*i%mod
  finv[n]=inv(fac[n])
  for i in range(n-1,table_size,-1):
    finv[i]=finv[i+1]*(i+1)%mod
  table_size=n

def binom(n,k):
  if n<0 or k<0:
    return 0
  if k>n:
    return 0
  if n>table_size:
    rebuild(n+10**4)
  return (fac[n]*finv[k]%mod)*finv[n-k]%mod

def fpow(x,k):
  res=1
  while k:
    if k&1:
      res=res*x%mod
    x=x*x%mod
    k>>=1
  return res

def inv(a):
  if a<table_size:
    return fac[a-1]*finv[a]%mod
  return fpow(a,mod-2)


from math import gcd
from collections import defaultdict
n,k=map(int,input().split())
a=list(map(int,input().split()))
pow2=[1]*(n+1)
for i in range(1,n+1):
  pow2[i]=pow2[i-1]*2%mod

if k==1:
  print(pow(2,n,mod)-1)
  exit()

cnt=defaultdict(int)
for i in a:
  cnt[gcd(k,i)]+=1

dp=defaultdict(int)
dp[1]=1

for i in cnt:
  ndp=defaultdict(int)
  c=cnt[i]
  for frm in dp:
    rem=pow2[c]
    tmp=frm
    for j in range(c+1):
      nxt=gcd(k,tmp*i)
      if tmp==nxt:
        ndp[tmp]+=dp[frm]*rem%mod
        ndp[tmp]%=mod
        break
      else:
        ndp[tmp]+=dp[frm]*binom(c,j)%mod
        ndp[tmp]%=mod
        rem-=binom(c,j)
        rem%=mod
        tmp=nxt
  dp=ndp

print(dp[k])