#include <bits/stdc++.h>
using namespace std;
long long n1, n2, k1, k2;
long long dp[101][101][11][11];
const long long mod = 100000000;
long long solve(int m1, int m2, int x1, int x2) {
  if (x1 > k1 || x2 > k2 || m1 < 0 || m2 < 0) return 0;
  if (m1 == 0 && m2 == 0) return 1;
  if (dp[m1][m2][x1][x2] != -1) return dp[m1][m2][x1][x2];
  return dp[m1][m2][x1][x2] =
             (solve(m1 - 1, m2, x1 + 1, 0) + solve(m1, m2 - 1, 0, x2 + 1)) %
             mod;
}
int main() {
  cin >> n1 >> n2 >> k1 >> k2;
  memset(dp, -1, sizeof dp);
  cout << (solve(n1 - 1, n2, 1, 0) + solve(n1, n2 - 1, 0, 1)) % mod << endl;
  return 0;
}
