#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

#define rep(i,a,b) for(int i=a;i<b;i++)

const int inf = 1001001000;
const int mod = 1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int digitsum(int i){
    int t = i;
    int ret = 0;
    while(t){
        ret += t%10;
        t /= 10;
    }
    return ret;
}

int cls(int a,int m){
    if(a%(m*2) <= m){
        return (a%(m*2));   
    }else if(a%(m*2) != 0){
        return m*2+1 - (a%(m*2));
    }else{
        return 1;
    }
}

int main(){
    int n,m;
    int a,b;
    cin >> n >> m >> a >> b;

    if (cls(a,m) == cls(b,m)){
        cout << "yes" << endl;
    }else{
        cout << "no" << endl;
    }

}