#include <bits/stdc++.h>
#define int long long
#pragma GCC optimize(2)
using namespace std;
const int mod = 998244353;
int n, m, f[5005][5005][2], a[5005][5005], ans, cnt, sum;
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> a[1][1] >> a[1][2];
	for (int i = 2; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			a[i][j] = (a[i - 1][j] + a[i - 1][j - 1] * a[i - 1][j - 1] % mod) % mod;
		}
	}
	ans = a[1][1] + a[1][2];
	for (int i = 2; i <= n; i++) {
		sum = 0;
		for (int j = 1; j <= n; j++) {
			sum = (sum + a[i][j]) % mod;
		}
		ans = (ans * sum) % mod;
	}
	f[1][1][0] = a[1][2];
	f[1][2][0] = a[1][1];
	for (int i = 1; i < n; i++) {
		for (int j = 1; j <= i + 1; j++) {
			f[i + 1][j][1] = (f[i + 1][j][1] + f[i][j][1] * a[i + 1][i + 2] % mod) % mod;
			f[i + 1][j][0] = (f[i + 1][j][0] + f[i][j][0] * a[i + 1][i + 2] % mod) % mod;
			f[i + 1][i + 2][1] = (f[i + 1][i + 2][1] + f[i][j][1 ^ ((i - j + 1) & 1)] * a[i + 1][j] % mod) % mod;
			f[i + 1][i + 2][0] = (f[i + 1][i + 2][0] + f[i][j][(i - j + 1) & 1] * a[i + 1][j] % mod) % mod;
		}
	}
	cnt = f[n][n + 1][1];
	cout << (ans - cnt + mod) % mod << " " << cnt << "\n";
}
//好好好，题目做法与生成方式强相关

//A 题只会40pts
//C 啥也不会，信仰剪枝可以拿到30pts