68pts求调

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353,N=1e4+10;
int n,w,last,rnt=1,total=1,flag=1;
int chai[N],kt;
struct node
{
	int sum,id,h;
}a[N];
int gcd(int x,int y)
{
	if(x>y)swap(x,y);
	if(x==0)return y;
    return gcd(y%x,x); 
}
bool cmp(node s1,node s2)
{
	return s1.sum<s2.sum; 
}
int getans(int x)
{
	int p=2,cnt=0,ans=1;
	while(x!=1)
	{
		cnt=0;
		while(x%p==0)cnt++,x/=p;
		ans*=(cnt+1);
		p++;
	}
	return ans;
}
void solve()
{
	for(int i=2;i<=w;i++)if(w%i==0)chai[++kt]=i;
	sort(a+1,a+1+n,cmp);
	last=kt;
	while(w!=1&&rnt<=n)
	{
		if(last<=1)break;
		for(int i=last;i>=1;i--)
		{
			if(w%chai[i]==0&&gcd(chai[i],a[rnt].h)==1)
			{
				a[rnt].h*=chai[i];
				a[rnt].sum=a[rnt].sum*getans(chai[i])%mod;
				last=i-1;
				w/=chai[i];
				break;
			}
		}
		rnt++;
	}
	if(w!=1)a[1].sum=getans(a[1].h*w);
	for(int i=1;i<=n;i++)
	{
		//cout<<a[i].sum<<" ";
		total=(total%mod*a[i].sum%mod)%mod;
	}
	printf("%lld",total);
}
signed main()
{
	//freopen("3.in","r",stdin);
	//freopen("ans.out","w",stdout);
	cin>>n>>w;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].h;
		if(a[i].h!=1)flag=0;
		a[i].sum=getans(a[i].h);
    }
    if(flag==1)puts("1");
    else solve();
	return 0;
}
/*
sub1:
5 1
1 1 1 1 1
sub2:
5 1
12 3 7 5 6
sub3:
1 170
120
*/