#include<bits/stdc++.h> using namespace std; const int mod = 998244353; const int maxn = 100000 + 10; int f[maxn] = {-1}; int n, x, y; int dfs(int u){ if(f[u] != -1){ //cout << "return f[u]: " << f[u] << "; return u: " << u << endl; return f[u]; } f[u] = 0; for(int i = min(u, n); i >= 0; i--){ if(u - i > i){//i=>going to be put in, (u - i) => from where break; } if(i == y){ continue; } //cout << "in cycle, while u is " << u << ", i is " << i << ", "; f[u] = (f[u] + dfs(u - i)) % mod; //cout << "f[u] is " << f[u] << " and f[u - i] is " << f[u - i] << endl; } //cout << "after cycle, return f[u]: " << f[u] << "; return u: " << u << endl; return f[u]; } int main(){ //freopen("J3.in", "r", stdin); //freopen("J3.out", "w", stdout); scanf("%d %d %d", &n, &x, &y); f[0] = 1; printf("%d\n", dfs(x)); return 0; }