#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M, P, Q;
	cin >> N >> M >> P >> Q;
	--P;
	int ans = 0, cur = 0;
	bool tuyoi[12] {};
	REP(i, Q) tuyoi[(P + i) % 12] = true;
	while (N > 0) {
		++ans;
		N -= M + (tuyoi[cur] ? M : 0);
		cur = (cur + 1) % 12;
	}
	cout << ans << endl;
}