#include <bits/stdc++.h>
using namespace std;
int matriz[101][101][11][11];
int l1, l2;
long long cantidad(int n1, int n2, int k1, int k2) {
  if (n1 < 0 || n2 < 0 || k1 < 0 || k2 < 0) return 0;
  if (n1 == 0 && n2 == 0) return 1;
  if (matriz[n1][n2][k1][k2] == -1)
    matriz[n1][n2][k1][k2] =
        (cantidad(n1 - 1, n2, k1 - 1, l2) + cantidad(n1, n2 - 1, l1, k2 - 1)) %
        100000000;
  return matriz[n1][n2][k1][k2];
}
int main() {
  for (int i = 0; i < 101; i += 1) {
    for (int j = 0; j < 101; j += 1) {
      for (int k = 0; k < 11; k += 1) {
        for (int l = 0; l < 11; l += 1) {
          matriz[i][j][k][l] = -1;
        }
      }
    }
  }
  int n1, n2, k1, k2;
  cin >> n1 >> n2 >> k1 >> k2;
  l1 = k1;
  l2 = k2;
  long long resultado = cantidad(n1, n2, k1, k2);
  cout << resultado << endl;
}
