#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1e6 + 5, mod = 998244353;
int p;
mt19937 rng(1293128);
map<ll, int> mp;
int qpow(int x, int y)
{
	int ans = 1;
	while(y)
	{
		if(y & 1)
			ans = (ll)ans * x % mod;
		x = (ll)x * x % mod;
		y >>= 1;
	}
	return ans;
}
int qpow_p(int x, int y)
{
	int ans = 1;
	while(y)
	{
		if(y & 1)
			ans = (ll)ans * x % p;
		x = (ll)x * x % p;
		y >>= 1;
	}
	return ans;
}
void mul_f(vector<int> &A, vector<int> B)
{
	int i, j, n, m;
	if(A.empty() || B.empty())
	{
		A.clear();
		return ;
	}
	n = (int)A.size() - 1;
	m = (int)B.size() - 1;
	A.resize(n + m + 1);
	for(i = n + 1; i <= n + m; i++)
		A[i] = 0;
	for(i = n; i >= 0; i--)
	{
		for(j = 1; j <= m; j++)
			A[i + j] = (A[i + j] + (ll)A[i] * B[j]) % mod;
		A[i] = (ll)A[i] * B[0] % mod;
	}
}
void mod_f(vector<int> &A, vector<int> B)
{
	int i, j, q, n, m;
	n = (int)A.size() - 1;
	m = (int)B.size() - 1;
	q = qpow_p(B.back(), p - 2);
	for(auto &o: B)
		o = (ll)o * q % mod;
	for(i = n; i >= m; i--)
	{
		q = p - A[i];
		for(j = 1; j <= m; j++)
			A[i - j] = (A[i - j] + (ll)q * B[m - j]) % mod;
		A[i] = 0;
	}
}
vector<int> qpow_f(vector<int> A, vector<int> B, int y)
{
	vector<int> ans = {1};
	while(y)
	{
		if(y & 1)
		{
			mul_f(ans, A);
			mod_f(ans, B);
		}
		mul_f(A, A);
		mod_f(A, B);
		y >>= 1;
	}
	return ans;
}
vector<int> gcd_f(vector<int> A, vector<int> B)
{
	int q;
	while(!A.empty())
	{
		B.swap(A);
		if(A.empty())
			break;
		mod_f(A, B);
	}
	q = qpow_p(B.back(), p - 2);
	for(auto &o: B)
		o = (ll)o * q % mod;
	return B;
}
vector<int> facto(vector<int> A) // A.back() = 1
{
	vector<int> ans, B, C;
	int i, j, n, m;
	if(A.size() == 1)
		return {};
	if(A.size() == 2)
		return {(p - A[0]) % p};
	do
	{
		B.resize(A.size() - 1);
		for(auto &o: B)
			o = rng() % p;
		B = qpow_f(B, A, (p - 1) / 2);
		B = gcd_f(A, B);
	}
	while(B.size() == 1 || B.size() == A.size());
	n = (int)A.size() - 1;
	m = (int)B.size() - 1;
	C.resize(n - m + 1);
	for(i = n - m; i >= 0; i--)
	{
		C[i] = A[i + m];
		for(j = 0; j < m; j++)
			A[i + j] = (A[i + j] + (ll)(p - C[i]) * B[j]) % mod;
		A[i + m] = 0;
	}
	ans = facto(B);
	C = facto(C);
	for(auto o: C)
		ans.emplace_back(o);
	return ans;
}
vector<int> fact(vector<int> A)
{
	while(!A.empty() && !A.back())
		A.pop_back();
	if(A.size() <= 1)
		return {};
	vector<int> B = {0, 1};
	B = qpow_f(B, A, p);
	B[1] = (B[1] + p - 1) % p;
	return facto(gcd_f(A, B));
}
bool ntp[N];
int prime[N], cnt;
ll res[N], val[N];
void sieve(int n)
{
	int i, j;
	for(i = 2; i <= n; i++)
	{
		if(!ntp[i])
			prime[++cnt] = i;
		for(j = 1; j <= cnt && i * prime[j] <= n; j++)
		{
			ntp[i * prime[j]] = 1;
			if(!(i % prime[j]))
				break;
		}
	}
}

int main()
{
	// freopen("sqr.in", "r", stdin);
	// freopen("sqr.out", "w", stdout);
	int n, a, b, c, i, j, k, S, ans = 1;
	ll x;
	vector<int> tmp;
	scanf("%d%d%d%d", &a, &b, &c, &n);
	x = (ll)a * n * n + (ll)b * n + c;
	S = pow(x, 1.0 / 3);
	while((ll)(S + 1) * (S + 1) * (S + 1) <= x)
		S++;
	sieve(S);
	for(i = 0; i <= n; i++)
		val[i] = res[i] = (ll)a * i * i + (ll)b * i + c;
	for(i = 1; i <= cnt; i++)
	{
		p = prime[i];
		if(p > S)
		{
			tmp = fact({c % p, b % p, a % p});
			for(auto o: tmp)
				for(k = (o ? o : p); k <= n; k += p)
					while(!(res[k] % p))
					{
						res[k] /= p;
						mp[p]++;
					}
		}
		else
			for(j = 0; j < p; j++)
				if(!(val[j] % p))
					for(k = (j ? j : p); k <= n; k += p)
						while(!(res[k] % p))
						{
							res[k] /= p;
							mp[p]++;
						}
	}
	for(i = 1; i <= n; i++)
		if(res[i] > 1)
		{
			S = sqrt(res[i]);
			while((ll)(S + 1) * (S + 1) <= res[i])
				S++;
			while((ll)S * S > res[i])
				S--;
			if((ll)S * S == res[i])
				mp[S] += 2;
			else
				mp[res[i]]++;
		}
	for(auto o: mp)
		ans = (ll)ans * qpow(o.first % mod, o.second / 2) % mod;
	ans = (ll)ans * ans % mod;
	printf("%d\n", ans);
	return 0;
}