#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;
    
    while (Q--) {
        ll n, m, p, q;
        cin >> n >> m >> p >> q;
        ll x = m * 12 + m * q;
        int ans = 0;
        if (n > x) {
            ans += n / x * 12;
            n %= x;
        }
        int t = 1;
        
        int r = p + q;
        if (r > 12)r -= 12;
        while (n>0) {
            
            n -= m;
            ans++;
            if (t >= p && t < p+q)n -= m;
            else if(t < r&&p+q>12)n -= m;
            t++;
            
        }
        cout << ans;
    }

    return 0;
}