#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e8;
int n, m, k1, k2;
int dp[110][110][2];
int main(int argc, char *argv[]) {
  cin >> n >> m >> k1 >> k2;
  dp[0][0][0] = dp[0][0][1] = 1;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= m; j++) {
      for (int t = 1; t <= min(i, k1); t++)
        dp[i][j][0] = (dp[i][j][0] + dp[i - t][j][1]) % MOD;
      for (int t = 1; t <= min(j, k2); t++) {
        dp[i][j][1] = (dp[i][j][1] + dp[i][j - t][0]) % MOD;
      }
    }
  }
  cout << (dp[n][m][0] + dp[n][m][1]) % MOD;
  return 0;
}
