#include <bits/stdc++.h>
using namespace std;
long long Set(long long N, long long pos) { return N = N | (1 << pos); }
long long reset(long long N, long long pos) { return N = N & ~(1 << pos); }
bool check(long long N, long long pos) { return (bool)(N & (1 << pos)); }
void CI(long long &_x) { scanf("%I64d", &_x); }
void CO(long long &_x) { cout << _x; }
template <typename T>
void getarray(T a[], long long n) {
  for (long long i = 0; i < n; i++) cin >> a[i];
}
template <typename T>
void prLLIarray(T a[], long long n) {
  for (long long i = 0; i < n - 1; i++) cout << a[i] << " ";
  cout << a[n - 1] << endl;
}
const double EPS = 1e-9;
const long long INF = 0x7f7f7f7f;
long long dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
long long dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
long long dr4[4] = {0, 0, 1, -1};
long long dc4[4] = {-1, 1, 0, 0};
long long kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
long long kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
int n1, n2, k1, k2;
int dp[101][101][11][11];
int rec(int r1, int r2, int l1, int l2) {
  if (r1 == 0 && r2 == 0) return 1;
  int &ans = dp[r1][r2][l1][l2];
  if (ans != -1) return ans;
  ans = 0;
  if (l1 + 1 <= k1 && r1 - 1 >= 0) {
    ans += rec(r1 - 1, r2, l1 + 1, 0);
    ans %= 100000000;
  }
  if (l2 + 1 <= k2 && r2 - 1 >= 0) {
    ans += rec(r1, r2 - 1, 0, l2 + 1);
    ans %= 100000000;
  }
  return ans;
}
int main() {
  cin >> n1 >> n2 >> k1 >> k2;
  memset(dp, -1, sizeof dp);
  cout << rec(n1, n2, 0, 0) << "\n";
}
