#include <bits/stdc++.h>
using namespace std;
bool J27 = 1;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  if (!J27) return;
  cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  if (!J27) return;
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
inline void INP();
const long long N = 3e6 + 7;
const long long INF = LLONG_MAX;
const long long inf = INT_MAX;
long long n, Q, K1, K2;
long long arr[N + 2], dp[101][101][11][11];
long long ways(long long n1, long long n2, long long k1, long long k2) {
  if (n1 == 0 and n2 == 0) return 1;
  long long& mafia = dp[n1][n2][k1][k2];
  if (mafia != -1) return mafia;
  long long ans = 0;
  if (n1 and k1 < K1) {
    ans += ways(n1 - 1, n2, k1 + 1, 0);
  }
  if (n2 and k2 < K2) {
    ans += ways(n1, n2 - 1, 0, k2 + 1);
  }
  ans %= 100000000;
  return mafia = ans;
}
void solve() {
  long long n1, n2;
  cin >> n1 >> n2 >> K1 >> K2;
  memset(dp, -1, sizeof(dp));
  cout << ways(n1, n2, 0, 0);
}
int32_t main() {
  J27 = 1;
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  INP();
  long long t = 1;
  while (t--) solve();
}
inline void INP() {}
