#include <bits/stdc++.h>
using namespace std;
long long mod = 1e8;
long long dp[105][105][12][12];
int main() {
  int n, m, k1, k2;
  cin >> n >> m >> k1 >> k2;
  dp[0][0][0][0] = 1;
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= m; ++j) {
      if (j < m) {
        for (int x = 0; x <= k1; ++x) {
          dp[i][j + 1][0][1] += dp[i][j][x][0];
          dp[i][j + 1][0][1] %= mod;
        }
      }
      if (i < n) {
        for (int x = 0; x <= k2; ++x) {
          dp[i + 1][j][1][0] += dp[i][j][0][x];
          dp[i + 1][j][1][0] %= mod;
        }
      }
      if (i < n) {
        for (int x = 1; x < k1; ++x) {
          dp[i + 1][j][x + 1][0] += dp[i][j][x][0];
          dp[i + 1][j][x + 1][0] %= mod;
        }
      }
      if (j < m) {
        for (int x = 1; x < k2; ++x) {
          dp[i][j + 1][0][x + 1] += dp[i][j][0][x];
          dp[i][j + 1][0][x + 1] %= mod;
        }
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= k1; ++i) {
    ans = (ans + dp[n][m][i][0]) % mod;
  }
  for (int i = 1; i <= k2; ++i) {
    ans = (ans + dp[n][m][0][i]) % mod;
  }
  cout << ans << endl;
  return 0;
}
