#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 23;
const int MOD = 1e8;
int n1, n2, k1, k2;
int dp[200 + 23][200 + 23][2];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n1 >> n2 >> k1 >> k2;
  for (int i = 1; i <= k1; i++) dp[i][0][0] = 1;
  for (int i = 1; i <= k2; i++) dp[0][i][1] = 1;
  for (int i = 1; i <= n1; i++) {
    for (int j = 1; j <= n2; j++) {
      for (int p = 0; p < 2; p++) {
        for (int c = 1; c <= 10; c++) {
          if (p == 0) {
            if (c <= min(k1, i)) dp[i][j][p] += dp[i - c][j][p ^ 1];
            dp[i][j][p] %= MOD;
            continue;
          }
          if (c <= min(k2, j)) dp[i][j][p] += dp[i][j - c][p ^ 1];
          dp[i][j][p] %= MOD;
        }
      }
    }
  }
  cout << (dp[n1][n2][0] + dp[n1][n2][1]) % MOD;
  return 0;
}
