#include <bits/stdc++.h>
using namespace std;
long long memo[101][101][11][11];
int n1, n2, k1, k2;
int main() {
  memset(memo, 0, sizeof(memo));
  cin >> n1 >> n2 >> k1 >> k2;
  for (int f = 0; f <= n1; f++) {
    for (int h = 0; h <= n2; h++) {
      for (int kf = 0; kf <= k1; kf++) {
        for (int kh = 0; kh <= k2; kh++) {
          long long ans = 0;
          if (f + h == 0) {
            ans = 1;
          } else {
            if (f > 0 && kf > 0) ans += memo[f - 1][h][kf - 1][k2];
            if (h > 0 && kh > 0) ans += memo[f][h - 1][k1][kh - 1];
          }
          memo[f][h][kf][kh] = ans % 100000000;
        }
      }
    }
  }
  cout << memo[n1][n2][k1][k2];
}
