#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long maxn = 1e9, minn = -1e9;
long long modpow(long long base, long long exp, int modulus) {
  base %= modulus;
  long long result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % modulus;
    base = (base * base) % modulus;
    exp >>= 1;
  }
  return result;
}
int main() {
  long long a, b;
  cin >> a >> b;
  long long k = a / b;
  if (k % 2 == 0)
    cout << "NO";
  else
    cout << "YES";
  return 0;
}
