#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n1, n2, k1, k2;
  cin >> n1 >> n2 >> k1 >> k2;
  long long dp[n1 + 1][n2 + 1][2];
  for (long long i = 0; i <= n1; i++)
    for (long long j = 0; j <= n2; j++) dp[i][j][0] = dp[i][j][1] = 0;
  dp[0][0][0] = dp[0][0][1] = 1;
  for (long long i = 0; i <= n1; i++)
    for (long long j = 0; j <= n2; j++) {
      for (long long k = 1; k <= k1; k++)
        if (i + k <= n1)
          dp[i + k][j][0] = (dp[i + k][j][0] + dp[i][j][1]) % 100000000;
      for (long long k = 1; k <= k2; k++)
        if (j + k <= n2)
          dp[i][j + k][1] = (dp[i][j + k][1] + dp[i][j][0]) % 100000000;
    }
  cout << (dp[n1][n2][1] + dp[n1][n2][0]) % 100000000;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.precision(20);
  long long t = 1;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
