import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final long H = sc.nextLong();
		final long W = sc.nextLong();
		final long N = sc.nextLong();
		final long K = sc.nextLong();
		
		final long MAX = Math.max(H, W);
		final long MIN = Math.min(H, W);
		// MIN回 ~ MAX + MIN 回 までの間に居ると負けずに死ぬように行動される?
		
		final long MIN_MOD_N = (MIN + 1) % N;
		final long DIST = MIN_MOD_N <= K ? ((N - 1) - MIN_MOD_N) + K : (K - 1) - MIN_MOD_N;
		
		System.out.println(DIST < MAX ? "YES" : "NO");
	}

}