#include <iostream>
#include <atcoder/modint>
#include <atcoder/convolution>
#include <vector>

using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
const int MX = 400010;
mint f[MX],inv[MX],fi[MX];
constexpr ll mod = 998244353;
void solve(){
    inv[1] = 1;
    for(int i=2;i<MX;i++){
        inv[i] = mod - (mod/i)*inv[mod%i];
    }
    f[0] = fi[0] = 1;
    for(int i=1;i<MX;i++){
        f[i] = f[i-1]*i;
        fi[i] = fi[i-1]*inv[i];
    }
}

mint nck(ll n, ll k){
    if(n<0 || k<0 || n<k) return 0;
    return f[n]*fi[k]*fi[n-k];
}

ll pw(ll a,ll x){
    ll ret = 1;
    while(x){
        if(x&1) (ret *= a) %= mod;
        (a *= a) %= mod; x /= 2;
    }
    return ret;
}

int main(){
    int i,j,n; cin >> n;
    ll B,C; cin >> B >> C;
    vector<mint> od(n + 1);
    vector<mint> ev(n + 1);
    solve();
    for(i=0;i<=n;i++){
        if(i&1){
            od[i] = nck(n,i);
        }else{
            ev[i] = nck(n,i);
        }
    }
    vector<mint> ret = {1};
    for(i=0;i<60;i++){
        if(C&1){
            ret = convolution(ret,od);
        }else{
            ret =  convolution(ret,ev);
        }
        vector<mint> ret2(n + 1);
        for(j=0;j<ret.size();j++){
            if((B + j)&1 || B<j) continue;
            ret2[j/2] = ret[j];
        }
        swap(ret,ret2);
        B /= 2; C /= 2;
    }
    cout << ret[0].val() << "\n";
}