/* -*- coding: utf-8 -*-
 *
 * 1191.cc:  No.1191 数え上げを愛したい(数列編) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_M = 300000;
const int MOD = 998244353;

/* typedef */

typedef long long ll;

/* global variables */

int fs[MAX_M + 1], invfs[MAX_M + 1];

/* subroutines */

int powmod(int a, int n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

inline int nck(int n, int k) {  // nCk % MOD
  return (ll)fs[n] * invfs[n - k] % MOD * invfs[k] % MOD;
}

void prepare_fracs(int n) {
  fs[0] = invfs[0] = 1;
  for (int i = 1; i <= n; i++) {
    fs[i] = (ll)fs[i - 1] * i % MOD;
    invfs[i] = powmod(fs[i], MOD - 2);
  }
}

/* main */

int main() {
  int n, m, a, b;
  scanf("%d%d%d%d", &n, &m, &a, &b);

  if ((ll)a * (n - 1) + 1 > b + 1) {
    puts("0");
    return 0;
  }

  prepare_fracs(m);

  int sum = 0;
  for (int l = a * (n - 1) + 1; l <= b + 1; l++) {
    int k = l - (a - 1) * (n - 1);
    sum = (sum + (ll)nck(k - 2, n - 2) * (m - l + 1) % MOD) % MOD;
  }

  sum = (ll)sum * fs[n] % MOD;
  printf("%d\n", sum);
  return 0;
}