#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};
combi C(1000000);

int main(){
	
	
	long long n,b,c;
	cin>>n>>b>>c;
	
	vector<mint> dp(n+1,0);
	dp[0] = 1;
	
	for(long long i=0;i<60;i++){
		vector<mint> t(n+1,0);
		rep(j,n+1){
			if(j%2 != ((c>>i)&1))continue;
			t[j] = C.combination(n,j);
		}
		dp = convolution(dp,t);
		vector<mint> ndp(n+1,0);
		rep(j,dp.size()){
			
			if(j%2 != ((b>>i)&1))continue;
			ndp[j/2] += dp[j];
		}
		swap(dp,ndp);
		
		
	}
	cout<<dp[0].val()<<endl;
	
	return 0;
}