#include <bits/stdc++.h>
using namespace std;
const int mod = 1e8;
long long dp[2][15][105][105] = {0};
int n1, n2, k1, k2;
int main() {
  cin >> n1 >> n2 >> k1 >> k2;
  for (int i = 1; i <= min(n1, k1); i++) dp[0][i][i][0] = 1;
  for (int i = 1; i <= min(n2, k2); i++) dp[1][i][0][i] = 1;
  for (int i = 1; i <= n1; i++)
    for (int j = 1; j <= n2; j++) {
      for (int k = 2; k <= min(k1, i); k++)
        dp[0][k][i][j] = dp[0][k - 1][i - 1][j] % mod;
      for (int k = 2; k <= min(k2, j); k++)
        dp[1][k][i][j] = dp[1][k - 1][i][j - 1] % mod;
      for (int k = 1; k <= min(k2, j); k++)
        dp[0][1][i][j] += dp[1][k][i - 1][j];
      dp[0][1][i][j] %= mod;
      for (int k = 1; k <= min(k1, i); k++)
        dp[1][1][i][j] += dp[0][k][i][j - 1];
      dp[1][1][i][j] %= mod;
    }
  long long ans = 0;
  for (int i = 1; i <= k1; i++) ans += dp[0][i][n1][n2];
  for (int i = 1; i <= k2; i++) ans += dp[1][i][n1][n2];
  ans %= mod;
  cout << ans << endl;
}
