#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <assert.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;


#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <bitset>
int n1, n2, k1, k2;
int ans;
const int MOD = 1e8;
int dp[111][111][12][12];
void work() {
    cin >> n1 >> n2 >> k1 >> k2;
    dp[0][0][0][0] = 1;
    for (int i = 0; i <= n1; ++i) {
        for (int j = 0; j <= n2; ++j) {
            for (int h = 0; h <= k1; ++h) {
                for (int z = 0; z <= k2; ++z) {
                    if (i != n1 && h != k1) {
                        dp[i + 1][j][h + 1][0] += dp[i][j][h][z];
                        dp[i + 1][j][h + 1][0] %= MOD;
                    }
                    if (j != n2 && z != k2) {
                        dp[i][j + 1][0][z + 1] += dp[i][j][h][z];
                        dp[i][j + 1][0][z + 1] %= MOD;
                    }
                }
            }
        }
    }
    int ans = 0;
    for (int i = 0; i <= k1; ++i) {
        for (int j = 0; j <= k2; ++j) {
            ans += dp[n1][n2][i][j];
            if (ans >= MOD) ans -= MOD;
        }
    }
    cout << ans << endl;
}

int main() {
#ifdef local
    freopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endif
    work();
    return 0;
}