2020-08-09

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=1e5+10;
const int MOD=998244353;
const int mod=MOD-1;
ll ksm(ll a,ll b)
{
	ll ret=1;
	while(b)
	{
		if(b&1)ret=ret*a%MOD;
		a=a*a%MOD,b>>=1;
	}
	return ret;
}
ll a,b,c,d,x,y,ans=1;
void solve(int p)
{
	ll aa=0,bb=0;
	while(x%p==0)aa++,x/=p;
	while(y%p==0)bb++,y/=p;
	if(aa==0||bb==0)return;
	ll tp=0;
	for(ll i=a;i<=b;i++)
	{
		ll j=aa*i/bb,tmp,now;
		if(j<c)tmp=(d-c+1)*i%mod*aa%mod;
		else if(j>=d)tmp=(c+d)*(d-c+1)/2%mod*bb%mod;
		else now=(c+j)*(j-c+1)/2%mod*bb%mod,tmp=(now+(d-j)*i%mod*aa%mod)%mod;
		tp=(tp+tmp)%mod;
	}
	ans=1ll*ans*ksm(p,tp)%MOD;
}
int main()
{
	scanf("%lld%lld%lld%lld%lld%lld",&a,&b,&c,&d,&x,&y);
	for(int k=2;k<=x;k++)if(x%k==0)solve(k);
	if(x>1)solve(x);
	printf("%lld\n",ans%MOD);
}