#include <bits/stdc++.h>
using namespace std;
const int N = 120;
const int MOD = 1e8;
int n1, n2, k1, k2;
int f[N][N][2];
int mod(int a) { return (a % MOD); }
int main() {
  scanf("%d %d %d %d", &n1, &n2, &k1, &k2);
  f[0][0][1] = f[0][0][0] = 1;
  for (int i = 0; i <= n1; i++)
    for (int j = 0; j <= n2; j++) {
      for (int k = 1; k <= min(k1, i); k++)
        f[i][j][1] = mod(f[i - k][j][0] + f[i][j][1]);
      for (int k = 1; k <= min(k2, j); k++)
        f[i][j][0] = mod(f[i][j - k][1] + f[i][j][0]);
    }
  printf("%d\n", mod(f[n1][n2][0] + f[n1][n2][1]));
  return 0;
}
