#include <bits/stdc++.h>
using namespace std;
int main() {
  int n1, n2, k1, k2, mod = 100000000;
  cin >> n1 >> n2 >> k1 >> k2;
  vector<vector<vector<int> > > DP(
      n1 + n2 + 1, vector<vector<int> >(n1 + 1, vector<int>(2, 0)));
  DP[0][0][0] = DP[0][0][1] = 1;
  for (int i = 1; i <= n1 + n2; i++) {
    int xyzyzyz = -1;
    for (int j = 0; j <= min(i, n1); j++) {
      for (int k = min(i - j, k2); k > 0; k--)
        DP[i][j][1] = (DP[i][j][1] + DP[i - k][j][0]) % mod;
      for (int k = min(j, k1); k > 0; k--)
        DP[i][j][0] = (DP[i][j][0] + DP[i - k][j - k][1]) % mod;
    }
  }
  cout << (DP[n1 + n2][n1][0] + DP[n1 + n2][n1][1]) % mod << endl;
  return 0;
}
