#include <stdio.h>

long long power_mod (long long a, long long b, long long mod_num) {
  long long ans = 1LL;
  
  if (b > 0LL) {
    ans = power_mod(a, b/2LL, mod_num);
    ans = (ans * ans) % mod_num;
    if (b%2LL == 1LL) {
      ans = (ans * a) % mod_num;
    }
  }
  
  return ans;
}

int main () {
  int c = 0;
  int x = 0;
  
  int res = 0;
  
  long long ans = 0LL;
  long long mod_num = 998244353LL;
  
  long long dp[2001][2001] = {};
  
  long long fact[2002] = {};
  long long invf[2002] = {};
  
  res = scanf("%d", &c);
  res = scanf("%d", &x);
  
  fact[0] = 1LL;
  for (int i = 0; i <= x; i++) {
    fact[i+1] = fact[i];
    fact[i+1] *= (long long) (i+1);
    fact[i+1] %= mod_num;
  }
  
  invf[x+1] = power_mod(fact[x+1], mod_num-2LL, mod_num);
  for (int i = x+1; i > 0; i--) {
    invf[i-1] = invf[i];
    invf[i-1] *= (long long)i;
    invf[i-1] %= mod_num;
  }
  
  if (x <= 0) {
    printf("%lld\n", power_mod((long long)(c+1), mod_num-2LL, mod_num));
    return 0;
  }
  
  dp[0][0] = 1LL;
  for (int i = 0; i+c < x; i++) {
    for (int j = 0; j <= i; j++) {
      long long tmp = dp[i][j];
      tmp *= (invf[c+i+1]*fact[c+i])%mod_num;
      tmp %= mod_num;
      dp[i+1][j] += (tmp*((long long)j))%mod_num;
      dp[i+1][j] %= mod_num;
      dp[i+1][j+1] += (tmp*((long long)(c+i+1-j)))%mod_num;
      dp[i+1][j+1] %= mod_num;
    }
  }
  
  if (c > x) {
    c = x;
  }
  
  for (int i = 0; i < x; i++) {
    long long tmp = (fact[x+1-i]+mod_num-fact[x-i])%mod_num;
    tmp *= invf[x+1-i];
    tmp %= mod_num;
    ans += (tmp*dp[x-c][i])%mod_num;
  }
  
  printf("%lld\n", ans%mod_num);
  return 0;
}