#include <bits/stdc++.h>
#define int long long
using namespace std;
using ll = long long;
using LD = long double;
using PII = pair<int, int>;
const int N = 1e3 + 10;
const int inf = 1e18;
const double eps = 1e-10;
const int mod = 1e9 + 7;
int n, _, m, k, z, p, qx, ans;
bool vis[N][N];
int dis[N][N][2];
bool check(int x, int y, int num)
{
    if (x < 0 || y < 0 || x > n || y > m || dis[x][y][z] != inf)
        return false;
    int lx = n - x, ly = m - num - y;
    return (lx == 0 || lx + qx >= ly);
}
void bfs()
{
    for (int i = 0; i <= n; i++)
    {
        for (int j = 0; j <= m; j++)
        {
            dis[i][j][0] = dis[i][j][1] = inf;
        }
    }
    queue<array<int, 4>> q;
    q.push({0, 0, 0, 0});
    while (!q.empty())
    {
        auto [x, y, z, w] = q.front();

        q.pop();
        if (dis[x][y][z] <= w)
            continue;
        // cout << x << " " << y << " " << z << ' ' << w << endl;
        dis[x][y][z] = w;
        for (int i = 0; i <= p; i++)
        {
            for (int j = 0; j <= p - i; j++)
            {
                int nx = x + i * (z == 0 ? 1 : -1), ny = y + j * (z == 0 ? 1 : -1), num = p - i - j;
                if (!check(nx, ny, num))
                    continue;
                q.push({nx, ny, 1 - z, w + 1});
            }
        }
    }
    int minn = inf;
    for (int i = 0; i <= m; i++)
    {
        minn = min(minn, dis[n][i][0]);
    }
    if (minn == inf)
        cout << -1 << endl;
    else
        cout << minn - 1 << endl;
}
void solve()
{
    cin >> n >> m >> p >> qx;
    bfs();
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed << setprecision(10);
    _ = 1;
    // cin >> _;
    while (_--)
    {
        solve();
    }
}