#include <bits/stdc++.h>
using namespace std;
const int SIZE = 1e5 + 10;
const double eps = 1e-5;
const int INF = 0x3f3f3f3f;
const long long mod = 1e8;
int n1, n2, k1, k2;
long long dp[105][105][12][12], ans = 0, sum = 0;
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n1 >> n2 >> k1 >> k2;
  dp[0][0][0][0] = 1;
  for (int i = 0; i <= n1; i++)
    for (int j = 0; j <= n2; j++)
      for (int x = 0; x <= k1; x++)
        for (int y = 0; y <= k2; y++) {
          if (i != n1 && x != k1)
            dp[i + 1][j][x + 1][0] =
                (dp[i + 1][j][x + 1][0] + dp[i][j][x][y]) % mod;
          if (j != n2 && y != k2)
            dp[i][j + 1][0][y + 1] =
                (dp[i][j + 1][0][y + 1] + dp[i][j][x][y]) % mod;
        }
  for (int i = 0; i <= k1; i++) ans = (ans + dp[n1][n2][i][0]) % mod;
  for (int i = 0; i <= k2; i++) ans = (ans + dp[n1][n2][0][i]) % mod;
  cout << ans;
  return 0;
}
