#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using pi = pair<int, int>;
void debug(int num, ...) {
  va_list valist;
  va_start(valist, num);
  for (int i = 0; i < num; i++) cout << va_arg(valist, int) << ' ';
  va_end(valist);
  cout << endl;
}
const int N = 110, mod = 1e8;
int n1, n2, k1, k2, dp[N][N][2];
void add_self(int &a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
void solve2() {
  cin >> n1 >> n2 >> k1 >> k2;
  for (int i = 0; i <= n1; i++)
    for (int j = 0; j <= n2; j++) dp[i][j][0] = dp[i][j][1] = 0;
  dp[0][0][0] = dp[0][0][1] = 1;
  for (int i = 0; i <= n1; i++) {
    for (int j = 0; j <= n2; j++) {
      for (int x = 1; x <= min(k1, i); x++)
        add_self(dp[i][j][0], dp[i - x][j][1]);
      for (int x = 1; x <= min(k2, j); x++)
        add_self(dp[i][j][1], dp[i][j - x][0]);
    }
  }
  int ans = dp[n1][n2][0];
  add_self(ans, dp[n1][n2][1]);
  cout << ans << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve2();
}
