#include <bits/stdc++.h>
#include <atcoder/convolution>
using namespace std;
const int D = 60;
const long long MOD = 998244353;
int main(){
  int N;
  long long B, C;
  cin >> N >> B >> C;
  vector<long long> inv(N + 1);
  inv[1] = 1;
  for (int i = 2; i <= N; i++){
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
  }
  vector<long long> fact(N + 1), finv(N + 1);
  fact[0] = 1;
  finv[0] = 1;
  for (int i = 1; i <= N; i++){
    fact[i] = fact[i - 1] * i % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
  vector<long long> cnt(N + 1);
  for (int i = 0; i <= N; i++){
    cnt[i] = fact[N] * finv[i] % MOD * finv[N - i] % MOD;
  }
  vector<vector<long long>> dp(D + 1, vector<long long>(N + 1, 0));
  dp[0][0] = 1;
  for (int i = 0; i < D; i++){
    vector<long long> F(N + 1, 0), G(N + 1, 0);
    for (int j = 0; j <= N; j++){
      if (j % 2 == ((B ^ C) >> i & 1)){
        F[j] = dp[i][j];
      }
      if (j % 2 == (C >> i & 1)){
        G[j] = cnt[j];
      }
    }
    vector<long long> FG = atcoder::convolution(F, G);
    for (int j = 0; j <= N * 2; j++){
      dp[i + 1][j / 2] += FG[j];
      dp[i + 1][j / 2] %= MOD;
    }
  }
  cout << dp[D][0] << endl;
}