#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e8;
long long dp[102][102][2], n1, n2, k1, k2;
int main() {
  cin >> n1 >> n2 >> k1 >> k2;
  dp[0][0][0] = dp[0][0][1] = 1;
  for (long long i = 0; i <= n1; ++i) {
    for (long long j = 0; j <= n2; ++j) {
      for (long long z = 1; z <= k1; ++z)
        if (i >= z) dp[i][j][0] = (dp[i][j][0] + dp[i - z][j][1]) % mod;
      for (long long z = 1; z <= k2; ++z)
        if (j >= z) dp[i][j][1] = (dp[i][j][1] + dp[i][j - z][0]) % mod;
    }
  }
  cout << (dp[n1][n2][0] + dp[n1][n2][1]) % mod;
}
