#include <bits/stdc++.h>
using namespace std;
signed main() {
  long long mod = 1e8;
  long long n0, n1, k0, k1;
  cin >> n0 >> n1 >> k0 >> k1;
  vector<vector<vector<long long>>> dp(
      n0 + 1, vector<vector<long long>>(n1 + 1, vector<long long>(2, 0)));
  dp[0][0][0] = 1;
  dp[0][0][1] = 1;
  for (long long i = 0; i <= n0; i++) {
    for (long long j = 0; j <= n1; j++) {
      for (long long k = 1; k <= min(i, k0); k++) {
        dp[i][j][0] += dp[i - k][j][1];
        dp[i][j][0] %= mod;
      }
      for (long long k = 1; k <= min(j, k1); k++) {
        dp[i][j][1] += dp[i][j - k][0];
        dp[i][j][1] %= mod;
      }
    }
  }
  cout << (dp[n0][n1][0] + dp[n0][n1][1]) % mod;
}
