#include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
using vi = vector <int>;
const ll mod = 998244353;

const int N = 12e4 + 11;
ll inv[N], fac[N], ifac[N];
ll binom(int n, int m) {
	if(n < m || m < 0) return 0; // n >= 0
	return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}

ll f[N], g[N];

int main() {
	inv[1] = fac[0] = ifac[0] = 1;
	for(int i = 2; i < N; i ++)
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
	for(int i = 1; i < N; i ++) {
		fac[i] = i * fac[i - 1] % mod;
		ifac[i] = inv[i] * ifac[i - 1] % mod;
	}
	ios::sync_with_stdio(0);
	
	int n; ll b, c;
	cin >> n >> b >> c;

	f[0] = 1;
	while(b > 0) {
		fill(g, g + N, 0);
		for(int i = 0; i <= n; i ++)
			for(int j = (c & 1); j <= n; j += 2) {
				g[i + j] += f[i] * binom(n, j);
				g[i + j] %= mod;
			}
		
		fill(f, f + N, 0);
		for(int i = 0; i <= n; i ++)
			f[i] = g[i * 2 + (b & 1)];
		
		b /= 2;
		c /= 2;
	}
	
	cout << f[0] << '\n';
}