#include <bits/stdc++.h>
using namespace std;
int ans = 0;
int arr[101][101][3][11];
int rec(int n1, int n2, int k1, int k2, int cur, int curCount) {
  if (n1 < 0 || n2 < 0) return 0;
  if (cur == 1) {
    if (curCount > k1) return 0;
  } else {
    if (curCount > k2) return 0;
  }
  if (n1 == 0 && n2 == 0) return 1;
  if (arr[n1][n2][cur][curCount] != -1) return arr[n1][n2][cur][curCount];
  if (cur == 1)
    return arr[n1][n2][cur][curCount] =
               (rec(n1 - 1, n2, k1, k2, 1, curCount + 1) % 100000000 +
                rec(n1, n2 - 1, k1, k2, 2, 1) % 100000000) %
               100000000;
  else
    return arr[n1][n2][cur][curCount] =
               (rec(n1 - 1, n2, k1, k2, 1, 1) % 100000000 +
                rec(n1, n2 - 1, k1, k2, 2, curCount + 1) % 100000000) %
               100000000;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  for (int a = 0; a < 101; ++a) {
    for (int b = 0; b < 101; ++b) {
      for (int c = 0; c < 3; ++c) {
        for (int d = 0; d < 11; ++d) arr[a][b][c][d] = -1;
      }
    }
  }
  int n1, n2, k1, k2;
  cin >> n1 >> n2 >> k1 >> k2;
  cout << (rec(n1 - 1, n2, k1, k2, 1, 1) % 100000000 +
           rec(n1, n2 - 1, k1, k2, 2, 1) % 100000000) %
              100000000;
  return 0;
}
