It's one more school day now. Sasha doesn't like classes and is always bored at them. So, each day he invents some game and plays in it alone or with friends.Today he invented one simple game to play with Lena, with whom he shares a desk. The rules are simple. Sasha draws n sticks in a row. After that the players take turns crossing out exactly k sticks from left or right in each turn. Sasha moves first, because he is the inventor of the game. If there are less than k sticks on the paper before some turn, the game ends. Sasha wins if he makes strictly more moves than Lena. Sasha wants to know the result of the game before playing, you are to help him.

The first line contains two integers n and k (1 ≤ n, k ≤ 1018, k ≤ n) — the number of sticks drawn by Sasha and the number k — the number of sticks to be crossed out on each turn.

If Sasha wins, print "YES" (without quotes), otherwise print "NO" (without quotes). You can print each letter in arbitrary case (upper of lower).

NoteIn the first example Sasha crosses out 1 stick, and then there are no sticks. So Lena can't make a move, and Sasha wins.In the second example Sasha crosses out 4 sticks, then Lena crosses out 4 sticks, and after that there are only 2 sticks left. Sasha can't make a move. The players make equal number of moves, so Sasha doesn't win.

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long n,k,s,s1;
    cin>>n>>k;
    if(n<k)
        cout<<"NO"<<endl;
    else if(n==k)
        cout<<"YES"<<endl;
        else if(n/k<2)
            cout<<"YES"<<endl;
        else{
            s=n/k;
            if(s%2==0)
                cout<<"NO"<<endl;
            else
                cout<<"YES"<<endl;
        }
}

#include <iostream>

using namespace std;

int main()
{
    long long n,k,c=0;
    cin >> n >> k;
    if((n/k)%2==0)cout << "NO";else cout << "YES";
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main(){
    long long n,k;
    cin >> n >> k;
    int p=n/k;
    if(p % 2 == 0){
        cout << "NO";
    }
    else{
        cout << "YES";
    }

    return 0 ;
}

#include<iostream>
using namespace std;

int main(){
	long long n,k; cin>>n>>k;
	if((long long)(n/k)%2==1) cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define fi() ios_base::sync_with_stdio;cin.tie(NULL);cout.tie(NULL);
#define ll long long int
int main()
{
        ll n,m;cin>>n>>m;
        if((n/m)&1)
        cout<<"YES";
        else
        cout<<"NO";
        cout<<endl;

    return 0;
}

#include <iostream>
using namespace std;

int main() {
	long long n, m;
    cin>>n>>m;
    if(n/m%2==0){
    	cout<<"NO";
    }
    else{
    	cout<<"YES";
    }
	return 0;
}

#include <bits/stdc++.h>

using namespace std;
long long n, k, x;
int main(){
    cin >> n >> k;
    x = n / k;
    if (x % 2 == 0) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
    return 0;
}

#include <cstdio>
using namespace std;
int main()
{
	long long n,k,maxn;
	scanf("%lld%lld",&n,&k);
	maxn = n / k;
	if(maxn % 2 == 0)
        printf("NO\n");
    else printf("YES\n");
    return 0;
 }

#include <stdio.h>
int main()
{
	 long long n,k,s=0,l=0,w=0;
	scanf("%lld %lld",&n,&k);

	n= n-(n%k);
	if (((n/k)%2)==0) printf("NO");
	else printf("YES");
  return 0;
}

#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>

using namespace std;

int main()
{
    long long int n,k,s;
    cin>>n>>k;
    s=n/k;
    if (s%2==0) cout<<"no";
    else cout<<"yes";
    return 0;
}

#include <iostream>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    long long a, b, c=0;
    cin >> a >> b;
    if(a % b == 0 && (a / b) % 2 == 1) cout<<"YES";
    else if(a % b == 0 && (a / b) % 2 == 0)cout<<"NO";
    else if((a/b) % 2 == 0)cout << "NO";
    else cout << "YES";
    return 0;
}

#include <iostream>

using namespace std;

int main(void)
{
    long long int x,y;
    cin>>x;
    cin>>y;
    if ((x/y)%2 == 0 )
    {
        cout<<"No";

    }
    else
    {
        cout<<"Yes";
    }

}

#include <bits/stdc++.h>
using namespace std;
int main(){
    long long int n,k;
    cin >> n >> k;
    long long int a=0;
    a = n / k;
    if(a == 0)
        cout<<"YES";
    else if(a % 2 == 0)
        cout<<"NO";
    else
        cout<<"YES";
}

#include <iostream>

using namespace std;
int main()
{
    long long n,k;
    cin >> n >> k;
    if((n/k)%2==0)
    {
        cout << "NO";
    }
    else
    {
        cout<< "YES";
    }
    return 0;
}

#include<bits/stdc++.h>

using namespace std;

long long n,k;

void fastscan(long long &number)
{
    register char c;
    c = getchar();
    for (; (c>47 && c<58); c=getchar())
        number = number *10 + c - 48;
}

int main()
{
    fastscan(n);
    fastscan(k);
    (((n / k) & 1) ? puts("YES") : puts("NO"));
}

#include<bits/stdc++.h>
using namespace std;

int main ()
{
    unsigned long long n,k,res;

    while (cin >> n >> k)
    {
        res = n/k;

        if (res & 1)
            cout << "YES\n";
        else
            cout << "NO\n";
    }

    return 0;
}

#include <cstdio>

long long int n, k;
long long int div, mod;
int main()
{
    scanf("%lld%lld", &n, &k);

    div = n / k;
    mod = n % k;

    if (k == 1) {
        if (n % 2 == 0) {
            puts ("NO");
        } else {
            puts("YES");
        }
    } else if (mod == 0) {
        if (div % 2 == 1) {
            puts("YES");
        } else {
            puts("NO");
        }
    } else {
        if (((div % 2 == 1 && mod != 0) || (div % 2 == 0 && mod == 0)))
            puts("YES");
        else
            puts("NO");
    }
}

#include<iostream>
#include<cstdio>
using namespace std;
long long n,k;
int main()
{
	cin>>n>>k;
	if((n/k)%2==0)
	cout<<"NO"<<endl;
	else
	cout<<"YES"<<endl;
	return 0;
}

#include <iostream>
#include <string>
using namespace std;

int main() {
    long long n,k;
    cin>>n>>k;

    if (n/k%2 == 0) {
        cout<<"NO";
    }
    else {
        cout<<"YES";
    }

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
long long n, k, x;
int main(){
    cin >> n >> k;
    x = n / k;
    if (x % 2 == 0) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main() {
   long long n,k;
    cin>>n>>k;
    if((n<k)||(n<1))
        return 0;
    n = n/k;
    if(n%2==1)
        cout<<"YES";
    else
        cout<<"NO";
    /*

    int i=0;
    int c[2]={0};
    while(n>=k){
        if(i%2 ==0){
            c[0]++;
            i++;

        }
        else{
            c[1]++;
            i++;

        }
        n=n-k;
    }
    if(c[0]>c[1])
        cout<<"YES";
    else
        cout<<"NO";*/
	return 0;

}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long  n,k,ans;
    cin >> n >> k;
    ans=n/k;
    if(ans%2!=0)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}

#include <iostream>

using namespace std;

int main(){
long long n, k;
cin >> n >> k;
if(int(n / k) % 2 == 0)
    cout << "NO";
else
cout << "YES";
return 0;
}

//in the name of god
//if you read this code please search about imam hussain
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb push_back;
#define endl "\n";
#define X first;
#define Y second;
#define pii pair<int,int>;
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define read freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);

const int maxn=1e5+5;
const int mod=1e9+7;
const int inf=1e9;
const int del=728729;

ll poww(ll a, ll b, ll md) {
    return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}
ll n;
ll k;
int main(){
	migmig;
	cin >> n >> k;
	ll moves=n/k;
	if(moves%2==0){
		cout<<"NO";
	}else cout<<"YES";
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

unsigned long long n, k, x;

int main(){
    cin >> n >> k;
    if (k == 0) {
    	cout << "NO";
    	return 0;
	}
    x = n / k;
    if (x % 2 == 0)  cout << "NO";
	else cout << "YES";
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long int n,k;
	cin>>n>>k;
	long long int sasha=0,other=0;
	long long int tmnt=0;
	if(n%k==0)
	{
	long long int rte=n/k;
	if(rte%2==0)
	{
		cout<<"NO";
	}
	else{
		cout<<"YES";

	}
	}
	else{
		n=n-(n%k);
			if(n%k==0)
	{
	long long int rte=n/k;
	if(rte%2==0)
	{
		cout<<"NO";
	}
	else{
		cout<<"YES";

	}

	}
	}}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 17, lg = 17;

ll n, k;
int main(){
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n >> k;
	cout << ((n / k) & 1 ? "YES" : "NO") << '\n';
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
long long n,k,x;
int main()
{
	cin>>n>>k;
	x=n/k;
	if(x%2==1)
		cout<<"YES"<<endl;
	else
		cout<<"NO"<<endl;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int MAX=1e+5;
bool p[MAX];
const int mod=10;
ll exp(ll x, ll n)  {
    if(n==0) return 1;
    if(n==1) return x;
    if(n%2==0) return exp((x*x)%mod,n/2);
    if(n%2==1) return (x*exp((x*x)%mod,n/2))%mod;
}
inline void seve() {
	int i,j;
	p[1]=p[0]=0;
	for(i=2; i<MAX; ++i)p[i]=1;
	for(i=2; i*i<MAX; ++i)
		if(p[i])
			for( j=i; i*j<MAX; ++j)p[i*j]=0;
	}

inline bool prime(ll b) {
	if(b<2)return 0;
	for(ll i=2; i*i<=b; ++i)
		if(b%i==0)return 0;
	return 1;
	}
inline int fi(int n) {
	int r = n;
	for(int i=2; i*i <= n; i++) {
		if (n % i == 0) r -= r/ i;
		while (n % i == 0) n /= i;
		}
	if (n > 1) r-= r/ n;
	return r;
	}
	inline int in(){int x; scanf("%d", &x);return x;}
bool di(int x){
	int sum=0;
	while(x!=0){
		sum+=(x%10);
		x=x/10;
	}
	return 0;}
int ds(int x){
	 return (__builtin_popcountll(x));}
	 ll n,m;
int main () {
	 FIO ;
	cin>>n>>m;
	if(m==0){
		cout<<"NO";return 0;}
	 cout<<((n/m)%2==1?"YES":"NO");

//printf("%.9f",(L*L-H*H)/(2*H));

		return 0;}

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define LL long long
using namespace std;

inline LL wread(){
	char c=getchar ();LL wans=0,flag=1;
	while (c<'0'||c>'9'){if (c=='-') flag=-1;c=getchar ();}
	while (c>='0'&&c<='9'){wans=wans*10+c-'0';c=getchar ();}
	return wans*=flag;
}

LL n,k;

int main (){
	n=wread(),k=wread();
//	printf("%lld\n",n);
	if (n<k)	puts("NO");
	else if (n==k)	puts("YES");
	else if (n%k==0){
		LL t=n/k;
		if (t%2==1){
			puts("YES");
		}
		else puts("NO");
	}
	else if (n%k!=0){
		LL t=n-n%k;
//		printf("%d\n",t);
		LL ah=t/k;
		if (ah%2==1){
			puts("YES");
		}
		else puts("NO");
	}
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
	long long n, k;
	cin >> n >> k;
	if ((n - k) % (2 * k) < k)
		cout << "YES";
	else
	{
		cout << "NO";
	}
	return 0;
}

#include <iostream>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
int a[100861],sum1[100861],sum2[100861];
signed main()
{
	int n,k;
	scanf("%lld%lld",&n,&k);
	if(n % k && (n / k) % 2) printf("YES");
	else if(!(n % k) && !((n / k) % 2)) printf("NO");
	else if(n % k && !((n / k) % 2)) printf("NO");
	else printf("YES");
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

    int main()
    {
        long long n,k ;
        cin>>n>>k;
        if (  (n/k)% 2 == 0 ) { cout << "NO" << endl; }
        else { cout << "YES" << endl;}
        return 0;
    }

#include<iostream>
using namespace std;
int main()
{
    long long int n,k,s;
    while(cin>>n>>k)
    {
        s=n/k;
        if(s%2==0)cout<<"NO"<<endl;
        else cout<<"YES"<<endl;
    }
    return 0;
}

#include<iostream>
#include<cstring>
#include <string>
#include<algorithm>
using namespace std;
const int L=110;
int sub(int *a,int *b,int La,int Lb)
{
    if(La<Lb) return -1;
    if(La==Lb)
    {
        for(int i=La-1;i>=0;i--)
            if(a[i]>b[i]) break;
            else if(a[i]<b[i]) return -1;

    }
    for(int i=0;i<La;i++)
    {
        a[i]-=b[i];
        if(a[i]<0) a[i]+=10,a[i+1]--;
    }
    for(int i=La-1;i>=0;i--)
        if(a[i]) return i+1;
    return 0;

}
string div(string n1,string n2,int nn)
{
    string s,v;//s存商,v存余数
     int a[L],b[L],r[L],La=n1.size(),Lb=n2.size(),i,tp=La;
     fill(a,a+L,0);fill(b,b+L,0);fill(r,r+L,0);
     for(i=La-1;i>=0;i--) a[La-1-i]=n1[i]-'0';
     for(i=Lb-1;i>=0;i--) b[Lb-1-i]=n2[i]-'0';
     if(La<Lb || (La==Lb && n1<n2)) {
     return "0";}//如果a<b,则商为0，余数为被除数
     int t=La-Lb;
     for(int i=La-1;i>=0;i--)
        if(i>=t) b[i]=b[i-t];
        else b[i]=0;
     Lb=La;
     for(int j=0;j<=t;j++)
     {
         int temp;
         while((temp=sub(a,b+j,La,Lb-j))>=0)
         {
             La=temp;
             r[t-j]++;
         }
     }
     for(i=0;i<L-10;i++) r[i+1]+=r[i]/10,r[i]%=10;
     while(!r[i]) i--;
     while(i>=0) s+=r[i--]+'0';
     i=tp;
     while(!a[i]) i--;
     while(i>=0) v+=a[i--]+'0';
     if(v.empty()) v="0";
     if(nn==1) return s;
     if(nn==2) return v;
}
int main()
{
    string a,b,c;
    while(cin>>a>>b){
    	c = div(a,b,1);
    	if (c[c.size()-1]%2)
    		printf("YES\n");
    	else
    		printf("NO\n");
	}

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long a,b;
    cin>>a>>b;
    if(a/b%2==1)
        printf("YES\n");
    else printf("NO\n");
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
long long n, k, x;
int main(){
    cin >> n >> k;
    x = n / k;
    if (x % 2 == 0) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
    return 0;
}

using namespace std;
#include<iostream>
void main()
{
	long long n,k;
	int c;
	cin>>n>>k;

		if(n/k%2==0)
			c=2;
		else
			c=1;

	if(c==2)
		cout<<"NO";
	else
		cout<<"YES";
}

/* Task description
https://codeforces.com/problemset/problem/832/A
*/

#include <iostream>

int main()
{
	unsigned long long n, k;
	std::cin >> n >> k;

	std::cout << (((n / k) % 2) ? "YES" : "NO");
}

#include<iostream>
int main()
{
    long long int n,k;
    std::cin>>n>>k;
    if((n/k)%2==1)
        std::cout<<"YES";
    else
        std::cout<<"NO";

    return 0;
}

#include <iostream>

using namespace std;

int main(){
	long long a, b;
	cin >> a >> b;
	if ((a / b) % 2 == 0)
		cout << "NO";
	else
		cout << "YES";
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long int n,k,x,y;
    cin>>n>>k;

    x=n/k;
    y=floor(x);
    if(y%2!=0)
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;

    return 0;
}

#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<stack>
#include<queue>
#include<map>
#include<ctime>
#include<vector>
#define inf 0x3f3f3f3f
#define ll long long
#define lson num<<1,l,mid
#define rson num<<1|1,mid+1,r
using namespace std;
ll read(){
	ll s=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){s=s*10+c-'0';c=getchar();}
	return s*f;
}
ll n,m;
int main(){
//  freopen(".in","r",stdin);
//  freopen(".out","w",stdout);
	n=read();m=read();
	if(n/m%2==1)printf("YES");
	else printf("NO");
	return 0;
}

#include <iostream>
using namespace std;
#define ll long long

ll n, k;

int main(){
    ios::sync_with_stdio(0);
    cin >> n >> k;
    cout << ((n/k)&1? "YES" : "NO");
    return 0;
}

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <tuple>
#include <set>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <numeric>

using namespace std;
typedef long long ll;
#define INF (1<<29)
#define LINF (1ll<<60)
#define PI 3.14159265359
#define _fi(n) for(int i = 0;i < n;i++)
#define _fj(n) for(int j = 0;j < n;j++)
#define _fk(n) for(int k = 0;k < n;k++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl '\n'

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    ll n, k;cin>>n>>k;
    if ((n/k)%2 != 0) cout << "YES" << endl;
    else cout << "NO" << endl;

    return 0;
}

#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int  main() {

	ios::sync_with_stdio(false);
	cin.tie(0);

	long long n, k;
	cin >> n >> k;
	//10 3

	//3
	//    3
	//3
	if (n == k || k > n / 2) {
		cout << "YES";
	}
	else {
		if ((n / k) % 2 == 1) {
			cout << "YES";
		}
		else {
			cout << "NO";
		}
	}

	return 0;
}

#include<bits/stdc++.h>

using namespace std;

int  main(){

	long long n,m;
	cin>>n>>m;

	long x=n/m;

	if(x&1)
	{

		cout<<"YES\n";}

	else{

		cout<<"NO\n";
		}

}

#include<bits/stdc++.h>
using namespace std;
long long n,m,lun;
int main()
{
    cin>>n>>m;
    lun=n/m;
    if(lun%2==1) cout<<"YES";
    else cout<<"NO";
    return 0;
}

#include<iostream>
using namespace std;

int main(){
	long long n,k;
	cin>>n>>k;
	long long s_step=0, l_step=0, line=n;
	if (n<k){
		cout<<"NO";
		return 0;
	}
	if ((line/k)%2)
		cout<<"YES";
	else
		cout<<"NO";

	return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main(){
	long long n,k;
	cin>>n>>k;
	if((n/k)%2==1){
		cout<<"YES"<<endl;
	}else{
		cout<<"NO"<<endl;
	}
	return 0;
}

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#include <unordered_map>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define PF(a) printf("%d\n", a)
#define SF(a) scanf("%d", &a)
#define SFF(a, b) scanf("%d%d", &a, &b)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 5005
#define mod 1000007
#define INF 1e15
using namespace std;
//------------------------------------------------------------------------------------------//
int main() {
	LL a, b;
	while (scanf("%lld%lld", &a, &b) == 2) {
		LL c = a / b;
		if (c % 2 == 1) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}

#include <iostream>
#include <math.h>
using namespace std;
int main()
{
    long long n,k;
    cin>>n>>k;

        if((n/k)%2==0)cout<<"NO"<<endl;
        else cout<<"YES";

    return 0;
}

#include <iostream>

using namespace std;
long long n , k ;
int main()
{
    cin >> n >> k ;
    if ( n == k ) cout << "yes" ;

    else
    {
       if( (n / k ) % 2 != 0  )cout << "YES" ;
       else cout << "NO" ;
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int n,x;
    cin>>n>>x;
    n/=x;
    //cout<<n<<endl;
    if(n%2!=0) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;

    return 0;
}

#include <iostream>

using namespace std;

int main(void)
{
    long long int x,y;
    cin>>x;
    cin>>y;
    if ((x/y)%2 == 0 )
    {
        cout<<"No";

    }
    else
    {
        cout<<"Yes";
    }

}

#include <bits/stdc++.h>
using namespace std;
long long n, k, x;
int main(){
    cin >> n >> k;
    x = n / k;
    if (x % 2 == 0) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
  int long long a,b,d=0;
  cin>>a>>b;
  d=a/b;
  if (d%2==0)cout<<"NO"<<endl;
  else cout<<"YES"<<endl;
return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long n,m;
    cin>>n>>m;
    //cout<<n/m<<endl;

    if((n/m)%2!=0)
        cout<<"YES"<<endl;
    else
       cout<<"NO"<<endl;

}

#include<bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	ll n , k,tmp ;

	cin >> n >> k;
	tmp = n/k;

	if( tmp%2 )
		cout << "YES" << endl;
	else
		cout << "NO" << endl;

	return 0;
}

#include <iostream>
using namespace std;
int main(){
	long long n,k;
	cin>>n>>k;
	if((n/k)%2==0){
		cout<<"No";
	}
	else if((n/k)%1==0){
		cout<<"Yes";
	}
	return 0;
}

#include<iostream>
using namespace std;
int main(){
	long long int a,b;

	cin>>a>>b;

	if(a/b%2==0){
		cout<<"NO";
	}
	else{
		cout<<"YES";
	}

  return 0;
}

#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
	int n,a;
	scanf("%lld%lld",&n,&a);
	n/=a;
	if(n&1) printf("YES");
	else printf("NO");
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	long long n,k;
	while(cin>>n>>k){
		if((n/k)%2==1){
			cout<<"YES"<<endl;
		}
		else{
			cout<<"NO"<<endl;
		}
	}
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
    unsigned long long int n, k, s, l;

    while(cin >> n >> k)
    {
         s = n/k;
         if(s % 2 == 0)
         {
             cout << "NO" << endl;
         }
         else
         {
             cout << "YES" << endl;
         }
    }

    return 0;
}

#include <bits/stdc++.h>
#define int long long
using namespace std;
int a,b;
main()
{
	cin>>a>>b;
	if((a/b)%2==1) cout<<"YES";
	else cout<<"NO";
	return 0;
}

#include<cstdio>
#include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>
#define QWQ while(1)printf("(〃'▽'〃)")
using namespace std;
inline int read()
{
	int X=0;
	bool flag=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-') flag=0;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		X=(X<<1)+(X<<3)+ch-'0';
		ch=getchar();
	}
	if(flag) return X;
	return ~(X-1);
}
inline int prin(int X)
{
	if(X<0)
	{
		putchar('-');
		X=~(X-1);
	}
	int s[20],top=0;
	while(X)
	{
		s[++top]=X%10;
		X/=10;
	}
	if(!top)s[++top]=0;
	while(top)putchar(s[top--]+'0');
}
using namespace std;
long long n,k;
int main()
{
    cin>>n>>k;
    if(n/k&1)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}

#include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <queue>
#include <cmath>
#include <limits>
#include <stack>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    long long n, k;
    cin >> n >> k;
    if ((n / k) % 2 == 0) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
}

#include<bits/stdc++.h>
using namespace std;
long long n,k,x;
int main()
{
    cin>>n>>k;
    x=n/k;
    if(x%2==0)
    {
        cout<<"NO"<<endl;
    }
    else
    {
        cout<<"YES"<<endl;
    }
    return 0;
}

#include <iostream>

using namespace std;

int main()
{
          long long n = 0, k = 0;
          cin >> n >> k;
          if ((n / k) % 2 != 0)
          {
                    cout << "YES";
          }
          else
          {
                    cout << "NO";
          }
}

#include<iostream>
#include<vector>
#include<stdio.h>
#include<algorithm>
using namespace std;

void main()
{
	long long n, k;
	cin >> n >> k;
	long long thuong = n / k;

	if (thuong % 2 == 0)
		cout << "NO";
	else
		cout << "YES";
}

#include <iostream>

using namespace std;

int main()
{ long long n,k,l;
cin>> n>>k;
 l=n/k;
 if (l%2!=0){
    cout <<"YES"<<endl;
 }
else { cout <<"NO"<<endl;}

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
 long long n, k;
 cin>>n>>k;
 n%=(2*k);
 if(n<k) cout<< "NO"<<endl;
 else cout<< "YES" <<endl;
 return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    long long n, k;
    cin >> n >> k;
    long long count =n/k;
    if(count%2==0) cout << "NO";
    else cout << "YES";
    return 0;
}

#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
    long long n,k;
    while(~scanf("%I64d%I64d",&n,&k)){
        long long ans = 0,  sum = 0;
        long long t = n / k;

        if(t % 2 == 1) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}

#include <bits/stdc++.h>

int main()
{
   long long int n,k,j;
   scanf("%lld %lld",&n,&k);
   if(n<=k)
    printf("YES");
   else
   {
   j=n/k;
   if(j%2==0)
    printf("NO");
   else
    printf("YES");
   }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
long long n,k;
int main()
{
	long long n,k;
    cin >>n;
        cin >>k;
	if((n/k)%2==0)
	 cout<<"NO";
	else
            cout<<"Yes";

	return 0;
}

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <stdio.h>
using namespace std;

int main() {
	long long n, k;
	cin >> n >> k;

	n /= k;

	if (n % 2 == 1)
		cout << "YES";
	else
		cout << "NO";
	return 0;
}

#include <iostream>

using namespace std;

int main()
{
    long long n, k, kek, xod;
    xod = 0;
    cin >> n >> k;
    kek = n / k;
    if (kek % 2 == 0)
        cout << "NO";
    else
        cout << "YES";

    return 0;
}

#include<bits/stdc++.h>

/***************>>    PRANTA KUMAR BISWAS    <<***************/
/******>>    DEPT. OF COMPUTER SCIENCE & ENGINEERING    <<****/
/***************>>    SESSION : 2016-2017    <<***************/
/**************>>    UNIVERSITY OF BARISAL    <<**************/

#define      pb           push_back
#define      mp           make_pair
#define      dbl          double
#define      fr(i,n)      for(int i = 0 ; i<n ;i++)
#define      fr1(i,n)     for(int i = 1 ; i<n ;i++)
#define      in(v)        v.begin(),v.end()
#define      max3(a,b,c)  max(a,max(b,c))
#define      min3(a,b,c)  min(a,min(b,c))
#define      nl           printf("\n");
#define      sf(n)        scanf("%d", &n)
#define      sff(n, m)    scanf("%d %d",&n,&m)

int i;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

/**************>>    TIME IS RUNNING OUT    <<**************/
/**************>>        START CODE        <<***************/
int main()
{
    ll n,k,v,v2;
    cin>>n>>k;
    if((n/k)%2==0)
    {
        cout<<"NO"<<endl;
    }
    else
    {
        cout<<"YES"<<endl;
    }
    return 0;
}

#include <iostream>
using namespace std;

int main()
{
    long long a,b,n;

    cin >> a >> b;
    if(b>=a)
    {
        cout << "YES";
        return 0;
    }
    n = a/b;
    if(n%2 == 0)
    {
        cout << "NO";
    }
    else
    {

        cout << "YES";
    }

}

#include <bits/stdc++.h>
using namespace std;

int main()
{

long long int n,k;
cin>>n>>k;
if(n==1 && k==1)
cout<<"YES";

else if(n==1)
cout<<"NO";

else {
    int r;
    r=n/k;
    if(r%2)
    cout<<"YES";
    else cout<<"NO";
}
return 0;
 }

#include<bits/stdc++.h>
using namespace std;
int main(){
	long long a,b;
	cin>>a>>b;
	if(a/b&1)cout<<"YES";
	else cout<<"NO";
}

#include<iostream>
using namespace std;
int main()
{
long long  n, k,g;
	cin >> n >> k;
	g = n / k;
	if (g % 2 == 0)
		cout << "NO";
	else
		cout << "YES";
	return 0;
}

#include <iostream>
#include <vector>

using namespace std;

int main(){
    long long n, k;
    cin>>n>>k;
    long long check = n/k;
    if(check % 2 != 0){
        cout<<"YES"<<endl;
    }
    else {
        cout<<"NO"<<endl;
    }

    return 0;
}

#include <iostream>
using namespace std;

int main(){
    long long n, k;
    cin >> n >> k;

    if((n/k)%2==0)
        cout << "NO" << endl;
    else
        cout << "YES" << endl;

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define FIO \
    freopen("input.txt","r",stdin); \
    freopen("output.txt","w",stdout);
void Solve()
{
    lli n,k; cin>>n>>k;
   cout<<((n/k)&1?"YES":"NO")<<endl;
}
int main()
{
 //   FIO;
    Solve();
    return 0;
}

#include <iostream>
using namespace std;
int main() {
	long long int n, k;
	cin >> n >> k;
	(long long int)(n / k) % 2 == 0 ? cout << "NO" : cout << "YES";
	return 0;
}

#include <iostream>
using namespace std;
int main() {
	long long int n, k;
	cin >> n >> k;
	if (k <= 0) {
		cout << "NO";

	}
	else if((n / k) % 2 == 1) {
	cout << "YES";
	}
	else
	{
		cout << "NO";
	}
}

#include<bits/stdc++.h>
using namespace std;
long long n,m,lun;
int main()
{
    cin>>n>>m;
    lun=n/m;
    if(lun%2==1) cout<<"YES";
    else cout<<"NO";
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main(){

	long long a, b, c;

	cin >> a >> b;

	c = a/b;

	if (c%2==0)
	cout << "NO" << endl;

	else
	cout << "YES" << endl;

	}

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int main(){
	int i, j;
	long long n, k, t;
	scanf("%I64d%I64d", &n, &k);
	if(n == k) printf("YES");
	else{
		t = 2*k;
		if(n - n/t*t < k) printf("NO");
		else printf("YES");
	}
	return 0;
}

#include <iostream>
using namespace std;
long long a,b,c,d,e,f,h,g,n,k;
int main(){
cin>>n>>k;
if(n%k==0){
  if((n/k)%2==0){
    cout<<"NO";
  }
  else cout<<"YES";
}else{
  if((n/k)%2==0)
  cout<<"NO";
  else cout<<"YES";
}
}

#include<bits/stdc++.h>
#include<algorithm>
using namespace std;

int main()
{
    long long n,k,c=0,x,y,m;
    scanf("%lld %lld",&n,&k);
    if(n<=k)
    {
        printf("YES\n");
    }
    else{
      for(x=1;x<=n;x=x+k)
      {
          c++;
      }
      printf("%d\n",c);
      if(c%2==0)
      {
          printf("YES\n");
      }
      else{
        printf("NO\n");
      }

    }

}

#include<iostream>
using namespace std;
int main()
{
    int a,b;
    cin>>a>>b;
    if(a/b%2==1)cout<<"YES";
    else cout<<"NO";
    return 0;
}

#include <iostream>

using namespace std;
long long oneorzero (int a)
{
    if(a%2==1)
        return 1;
    else return 0;
}

int main()
{
    long long n, k, num;
    cin>>n>>k;
    num=n/k;
    if( oneorzero(num)==1)
        cout<<"YES"<<endl;
    else cout<<"NO"<<endl;

}

#include<cstdio>
#include<iostream>
#include<string>
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<limits>
#include<climits>
#include<cfloat>
#include<cstdlib>
#include<cwchar>
#include<ctime>
#include<memory>
#include<list>
#define QWQ while(1)puts("(〃'▽'〃)")
using namespace std;
long long a,b;
int main()
{
    scanf("%d%d",&a,&b);
    if(a/b%2!=0)printf("YES");
    else printf("NO");
    return 0;
}

#include <iostream>
using namespace std;
int main()
{
	long long n,k;
	cin>>n>>k;
	long long a=n/k,b=n%k;
	if(b) a++;
	if(a%2&&b) cout<<"NO";
	else cout<<"YES";
	return 0;
}

 #include <iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;

int main()
{ int n,k;
   cin>>n>>k;
   if(n%2==0)
   {
       if(n%k==0)
       {
           cout<<"NO";
           return 0;
       }
       else
       {
           if((n/k)%2==0)
           {cout<<"NO";}
           else{
               cout<<"YES";
           }
       }
   }
   else
   {
       if(n%k==0)
       {
           cout<<"YES";
           return 0;
       }
       else
       {
           if((n/k)%2==0)
           {
               cout<<"NO";
           }
           else
           {
               cout<<"YES";
           }
       }
   }
return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define MAXN 100000
int main()
{
	long long n;
	long long k;
	cin>>n>>k;
	if(n%k==0)
	{
		cout<<"YES"<<endl;
	}
	else
	{
		cout<<"NO"<<endl;
	}
}

#include <stdio.h>
#include <stdlib.h>

int main()
{
    long long n,k;
  scanf("%lld%lld",&n,&k);
        if(n%k==0)
            printf("YES\n");
        else
            printf("NO\n");

}

#include<iostream>
using namespace std;
int main()
{
    long long int t,a;
    cin>>t>>a;
    if(t%a!=0)
        cout<<"NO";
    else
        cout<<"YES";

        return 0;
}

#include<bits/stdc++.h>
using namespace std;
long long b,n,k;
int main()
{
	scanf("%d%d",&n,&k);
	b=n/k;
	if(b%2!=0) printf("YES");
	else printf("NO");
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long z,x,c;
	cin>>z>>x;
	c=z/x;
	if(c>x)
	    {
        printf("NO");
    }
    else
    {
        printf("YES");
    }
    return 0;
}
   /* long long int n,k,c;
    scanf("%I64d %I64d",&n,&k);

    c=n/k;
    if(c%2==1)*/

#include <bits/stdc++.h>
using namespace std;

int main(){
	long long n,k,count1=0,count2=0;
  cin>>n>>k;
  if(n<2*k){
    cout<<"yes";return 0;}
if(k==1){
    cout<<"no";
    return 0;
}
  if(n%k==0)
    cout<<"yes";
  else cout<<"no";
}

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <string>

using namespace std;

int main(){
   long long int n,k;

   cin>>n>>k;

   bool cek = true;
   int s = 0,l= 0;
   bool turn = true;
   while(n > k){

        n-=k;
        if(turn){
            s++;turn = false;
        }else{
            l++;turn = true;
        }
   }

   if(s > l){
        cout<<"YES";

   }else{
   cout<<"NO";
   }

}

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
#define ll long long
using namespace std;
int main()
{
    ll n,k;
    cin>>n>>k;
    ll ans=n/k;
    if(ans&1==0)printf("NO");
    else printf("YES");
    return 0;
}

#include <iostream>

using namespace std;

int main()
{
    int n, k, ans = 0;
    cin >> n >> k;
    while (n>= k)
    {
        n-=k;
        ans++;
    }
    if (ans % 2 == 1)
    cout << "YES";
    else
    cout << "NO";

}

#include<bits/stdc++.h>

using namespace std;

int  main(){

	int n,m;
	cin>>n>>m;

	if(m<n&&m%2!=0)
	{
		cout<<"YES";

		}

		else{
			cout<<"NO";

			}

}

#include <bits/stdc++.h>

using namespace std;

int main() {
    long long int n, k, left;
    cin >> n >> k;
    if (n == 1) {
        cout << "YES";
        return 0;
    }
    if ((n%k)%2 == 0) {
        cout << "NO";
    } else {
        cout << "YES";
    }
}

#include<iostream>
using namespace std;
int main()
{
	int n,k,i=0;
	cin>>n>>k;
	while(1)
	{
		n=n-k;
		i++;
		if(n<k)
		{
			break;
		}
	}
	if(i%2!=0)
	cout<<"YES"<<endl;
	if(i%2==0)
	cout<<"NO"<<endl;
	return 0;
}

#include<iostream>
using namespace std;

int main() {
    long long int n, k;
    cin>>n>>k;

    if ( (n+k)%(2*k) == 0) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int n,k,a=0,b=0,l,p;
    cin>>n>>k;
    l=n;
    p=k*2;
    //l=l%k;
    while(1)
    {
        l=l-p*2;
        if(l<0)
        {
            l=l+p*2;
            break;
        }
    }
    //cout<<l<<endl;
    if(l>=k)
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,k,m;
    cin>>a>>b;
    if(a%2==0&&b%2==0)
        cout<<"NO"<<endl;
        else
        cout<<"YES"<<endl;
}

#include <iostream>
#include <cmath>
#include <math.h>
#include <algorithm>
#include <vector>

using namespace std;

int main(){
	int k,n;
	cin >> n >> k;
	if (n == k){
		cout << "YES" << endl;
		return 0;
	}
	int ans = 0;
	ans = ceil(n/k);
	if ((ans % 2) == 0){
		cout << "NO" << endl;
	}
	else{
		cout << "YES" << endl;
	}
	return 0;
}

#include <iostream>

using namespace std;

int main()
{
    long long int n, k; cin >> n >> k;
    if(n%k==0){cout << "YES\n";}
    else{cout << "NO\n";}
    return 0;
}

#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
	int m,n,k, s=0,l=0;
	cin>>n;
	cin>>k;
while(n>k)
{
	n=n-k;
	s++;
	n=n-k;
	l++;
}
if(s>l)
{
	cout<<"yes";

}
if(n==k)
{
	cout<<"yes";
}
else
cout<<"no";
}

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
using namespace std;
ll ans,i,ans1,a,l,s,n,k;
main(){
	cin>>n>>k;
	for(i=1;i<=n;i++){
		n-=k,ans++;
	}
	if(ans%2==0)cout<<"NO";
	else cout<<"YES";

}

#include<iostream>
#include<string>
using namespace std;
int main() {

	int n, k;
	cin >> n >> k;

	if (n == k) {
		cout << "YES" << endl;
	}
	else if (n > k) {
		cout << "NO" << endl;
	}
	else if (n < k) {
		cout << "YES" << endl;
	}

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	long long a,k;
	cin>>a>>k;
	if(a%k==0) cout<<"YES";
	else cout<<"NO";
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long  n,k,ans;
    cin >> n >> k;
    ans=n/k;
    if(n>2 && k==1)
        cout << "NO" << endl;
   else if((n/k)>=2 && (n%k)!=0 && (ans%2)==0)
        cout << "NO" << endl;
    else
        cout << "YES" << endl;
}

#include<map>
#include<algorithm>
#include<iostream>
#include<set>
#include<stack>
#include<unordered_map>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define IO ios_base::sync_with_stdio(false);  cin.tie(NULL);
#define ll long long int
#define nn cout<<"\n"
#define rep(i,n) for (i = 0; i < n; i++)
using namespace std;
int main()
{
	IO;
	int n,m;
	cin>>n>>m;
	(n%m)%2==0?cout<<"YES":cout<<"NO";
}

#include<bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x,val) memset(x,val,sizeof(x))
#define mk make_pair
#define f(i,n) for(i=0;i<n;i++)
#define f1(i,n) for(i=1;i<=n;i++)
#define all(a) a.begin(),a.end()
#define upp(v,val) upper_bound(v.begin(),v.end(),val)
#define lower(v,val) lower_bound(v.begin(),v.end(),val)
#define dbg(x) cout<<#x<<" = "<<x<<endl
#define dbg2(x,y) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<endl
#define dbg3(x,y,z) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<endl
#define dbg4(x,y,z,q) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<", "<<#q<<" = "<<q<<endl
#define speed() ios_base::sync_with_stdio(false); cin.tie(NULL);
#define S second
#define F first
#define fm(it,m) for(it=m.begin();it!=m.end();it++)
#define ct_set(n) __builtin_popcount(n) // count no of set bits
#define INF 0x3f3f3f3f
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265    // acosl(-1)
#define precision cout<<setprecision(15)
#define print_arr(a,n) for(int i=0;i<n;i++) cout<<a[i]<<" ";
#define print_vec(v) for(int i=0;i<v.size();i++) cout<<v[i]<<" ";
//vec.erase(std::remove(vec.begin(), vec.end(), val), vec.end());
using namespace std;

// fflush(stdout);  // after every output

bool isPrime(ll n)
{
    // Corner cases
    if (n <= 1)
        return false;
    if (n <= 3)
        return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n % 2 == 0 || n % 3 == 0)
        return false;

    for (ll i = 5; i * i <= n; i = i + 6)
        if (n % i == 0 || n % (i + 2) == 0)
            return false;

    return true;
}

vector<ll> primes;

bool prime[10005];
void seive()
{
	mem(prime,1);
	prime[0]=0;
	prime[1]=0;
	for(ll i=2;i<=10000;i++)
	{
		if(prime[i]==1)
		{
			for(ll j=i*i;j<=10000;j+=i)
			prime[j]=0;
		}
	}

}

ll power(ll a,ll b)
{
	ll ans=1;
	while(b>0)
	{
		if(b%2==1)
		ans=(ans%mod*a%mod)%mod;
		a=(a*a)%mod;
		b=b/2;
	}
	return ans;
}

template <typename T>
std::string NumberToString ( T Number )
{
 std::ostringstream ss;
 ss << Number;
 return ss.str();
}

string no_to_bits(ll n)
{
	string temp="";
	while(n)
	{
		temp+=(n%2)+'0';
		n/=2;
	}
	reverse(all(temp));
	return temp;
}

ll bits_to_no(string s)
{
	ll ans=0,var=0;
	for(int i=s.size()-1;i>=0;i--)
	{
		ans+=pow(2,var++)*(s[i]-'0');
	}
	return ans;
}

void solve()
{
	ll n,k;
	cin>>n>>k;
	if(k%2)
	cout<<"YES";
	else
	cout<<"NO";

}

int main()
{
	speed()

//	freopen("input.txt", "r" , stdin);
//  freopen("output.txt", "w", stdout);

//	seive();
//	for(int i=2;i<=10000;i++)
//	{
//		if(prime[i])
//		primes.pb(i);
//	}

	bool codechef=0;
	ll t=1;

	if(codechef)
	cin>>t;

	while(t--)
	{
		solve();
	}
	return 0;
}

#include <iostream>
#include <cstdio>
using namespace std;
int main(void)
{
    long long int n,k;
    cin>>n>>k;
    if(n/k%2==0)
        printf("YES\n");
    else
        printf("NO\n");
}

#include<bits/stdc++.h>

using namespace std;

int main()
{
    long long int i, j, k, n;
    cin>>n>>k;
    if(k%2 == 1)
    {
        cout<<"YES"<<endl;

    }
    else
    {
        cout<<"NO"<<endl;
    }
    return 0;
}

//g++  5.4.0

#include <iostream>

int main()
{
    unsigned int n;
    scanf("%d", &n);

    unsigned int k;
    scanf("%d", &k);

    n = n % (2*k);

    std::cout << n ;

    if (n == 0 || n < k)
    {
        printf("NO");
    } else
    {
        printf("YES");
    }

}

#include <bits/stdc++.h>
#define llong long long int
#define IOI_GOLD ios_base::sync_with_stdio(0); cin.tie(); cout.tie()

using namespace std;

const long long MXN = 1e5 + 7;
int main(){
IOI_GOLD;
long long int n, m;
cin >> n >> m;
if( n % 2 != 0 && m % 2 != 0){
    cout << "YES";
    return 0;
}
else if(n % 2 == 0 && m % 2 == 0 || n % 2 != 0 && m % 2 == 0 || n % 2 == 0 && m % 2 != 0){
    cout << "NO";
    return 0;
}
}

#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main()
{
    int n, k, f = 0;
    cin >> n;
    cin >> k;
    if (n == k)  {
        cout << "YES";
    }
    else {
        for (int i = n; i < k; i -= k) {
            f += 1;
        }
        if (f % 2 == 1)
            cout << "YES";
        else
            cout << "NO";
    }
}

#include <bits/stdc++.h>
using namespace std;
long long n, m;
int main() {
    cin >> n >> m;
    bool win = false;
    while (n) {
        win = !win;
        n -= m;
        if (n < 0) {
            cout << "NO" << endl;
            return 0;
        }
    }
    if (win) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }
    return 0;
}

#include <iostream>
using namespace std;

int main() {
	int n , k ,r ;
	cin>>n>>k ;
    r = n/k ;
    if(r%2==0) cout<<"NO\n";
    else cout<<"YES\n" ;
}

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long num,s;cin>>num>>s;
    long long x=num%s;
    if (x==0){
        cout<<"YES"<<endl;
    }
    else if (x%2!=0){
cout<<"YES"<<endl;
    }
    else if (x%2==0){
        cout<<"NO"<<endl;
    }

    return 0;
}

#include<stdio.h>
#include<cmath>
using namespace std;
int main(){
	int n,k;scanf("%d%d",&n,&k);int xx=(n/k);
	if(xx%2 == 0) puts("NO");
	else puts("YES");
	return 0;
}

#include <iostream>
using namespace std;
long long f(long long a)
{
    if(a==1)return 1;
    return a*f(a-1);
}

int main()
{
long long a,b;
cin>>a>>b;
    if(a % b != 0)
    {
        cout<<"NO";
        return 0;
    }
    cout<<"YES";
    return 0;
}

#include<bits/stdc++.h>

using namespace std;

long long n,k;

void fastscan(long long &number)
{
    bool negative = false;
    register int c;
    c = getchar();
    for (; (c>47 && c<58); c=getchar())
        number = number *10 + c - 48;
}

int main()
{
    fastscan(n);
    fastscan(k);
    long long r = 0;
    while(n > k)
    {
        r ++;
        n -= k;
    }
    ((r & 1) ? puts("YES") : puts("NO"));
}

#include<iostream>
using namespace std;
int main()
{
    cout<<"YES";
    return 0;
}

#include<iostream>
using namespace std ;
int main ()
{
	long long int n , k , c1=0 , c2=0 ;
	cin >> n >> k ;
	long long int s=n;
	for ( int i=1 ; s<k ; i++)
	{
		s-=k;
		if (i%2 != 0)
		{
			c1++;
		}
		else
		{
			c2++;
		}
	}
	if (c1>c2)
	{
		cout << "YES" ;
	}
	else if (c1==c2 || c1<c2)
	{
		cout << "NO" ;
	}
}

#include <iostream>
using namespace std;
int main()
{
    long long n;
    long long k;
    int c=0;
    cin>>n>>k;
    while(n>k){
        n=n-k;
    }

    if(n!=k) cout<<"NO";
    else cout<<"YES";

    return 0;
}

#include<bits/stdc++.h>

using namespace std;

int main()
{
	int a, b;
	scanf("%d%d", &a, &b);
	if((a/b)%2==0)
	{
		printf("NO");
	}
	else
	{
		printf("YES");
	}
	return 0;
}

#include<iostream>
using namespace std;

int main()
{
long int n,k;
cin>>n;
cin>>k;
long int a=n/k;
if(k>n)
{
cout<<"NO";
}
else
{
	if(a%2==1)
	{
	cout<<"YES";
	}
	else
	cout<<"NO";
}

}

#include<iostream>
using namespace std;
int main()
{
	int n, k;
	cin>>n>>k;
	int a = 0, b = 0;
	if(k==n)
	{
		cout<<"YES";
		return 0;
	}
	while(n>=k)
	{
		n = n - k;
		a = a + 1;
		if(n - k > 0){
		  n = n - k;
		  b = b + 1;
		}
	}
	if(a > b) cout<<"YES";
	else cout<<"NO";
	return 0;
}

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,k,y;
    cin>>n>>k;
    y=n-k;
    if(k>y)
        cout<<"YES";
    else if(k<y)
        cout<<"NO";
    else if(k==y)
        cout<<k;
    return 0;
}

#include<bits/stdc++.h>

using namespace std;

int  main(){

	int n,m;
	cin>>n>>m;

	int x=n/m;

	if(x&=0)
	{

		cout<<"YES";}

	else{

		cout<<"NO";
		}

}

#include <iostream>

int main()
{
  int a,b;
  std::cin>>a>>b;
  if ((b>0) || (b<0))
  {
    if ((a/b)%2==1) std::cout<<"YES";
    if((a/b)%2==0) std::cout<<"NO";
  }
  if (b==0) std::cout<<"NO";
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,k,c=0;
    cin>>n>>k;
    if(k<=n){
    while(n>0&&n!=k){
    n=n-k;
    c++;
   }
   }
   if((c%2==0)||n==k)
    cout<<"YES"<<endl;
   else
    cout<<"NO"<<endl;
}

#include <iostream>
using namespace std;

int main()
{
	 long long int n,k;
	cin >> n;
	cin >> k;
	long long int f;
	f=n/k;
	if (k%2==0)
		cout << "NO";
	else
		cout << "YES";
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,k,m;
    cin>>a>>b;
    if(a%2==0&&b%2==0||a%2!=0&&b%2==0)
        cout<<"NO"<<endl;
        else
        cout<<"YES"<<endl;
}

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define LL long long
using namespace std;

inline LL wread(){
	char c=getchar ();LL wans=0,flag=1;
	while (c<'0'||c>'9'){if (c=='-') flag=-1;c=getchar ();}
	while (c>='0'&&c<='9'){wans=wans*10+c-'0';c=getchar ();}
	return wans*=flag;
}

LL n,k;

int main (){
	n=wread(),k=wread();
//	printf("%lld\n",n);
	if (n%k==0||n<=k)	puts("YES");
	else puts("NO");
	return 0;
}

#include <iostream>

using namespace std;

int main()
{
    int n, k, xod;
    xod = 0;
    cin >> n >> k;
    while (n >= 0)
        if (n - k >= 0) {
            n = n - k;
            xod++;
        } else
            break;

    if (xod % 2 == 0)
        cout << "NO";
    else
        cout << "YES";

    return 0;
}

#include <iostream>
using namespace std;
int main()
{
    long long n;
    long long k;

    cin>>n>>k;

    if((n%2)==0) cout<<"no";
    else cout<<"yes";

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define gtl(x) getline(cin, (x))
#define PI acos(-1)
int main()
{
    int n, k;
    cin >> n >> k;
    int x=n/k;
    if(x>=k)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
    return 0;
}

#include<iostream>
using namespace std;
int main()
{
	int n,k,a=0,b=0;
	cin>>n>>k;
	for (int i=0;i<n;i++)
	{
		a+=k;
		b+=k;
		if (a==n)
		{
			cout<<"YES"<<endl;
		}
		else
		{
			cout<<"NO"<<endl;
			break;
		}
	}
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
    cout<<"YES";
    return 0;
}

#include <iostream>

using namespace std;

int main()
{
    int n,k,sasa=0,oponent=0;
    cin>>n>>k;
    if(n>=k)
    {
        while(n>=k)
        {
            n=n-k;
            sasa++;
            if(n<k) cout<<"YES";
            else if (n>=k)
            {
                n=n-k;
                oponent++;
            }
        }
    }
    if(sasa==oponent) cout<<"NO";
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main()
{
	int a, b;
	cin >> a >> b;;
	bool x = true, y = true, z = true;
	while (x == true && y == true){
		if (z == true){
			a -= b;
			if (a < 0)
				x = false;
			z = false;
		}
		else {
			a -= b;
			if (a < 0)
				y = false;
			z = true;
		}
	}
	if (x == true && y == false)
		cout << "YES";
	else
		cout << "NO";
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
	int n,k;
	cin>>n>>k;
	if((n/k)%2)cout<<"YES";
	else cout<<"NO";
	return 0;
}

#include <iostream>
using namespace std;
int main()
{
    long long int n,k;
    cin>>n>>k;
    if(n%k==0)  cout<<"YES";
    else    cout<<"NO";
    return 0;
}

#include <iostream>
#include <cstdio>
using namespace std;
int main(void)
{
    int n,k;
    scanf("%d%d",&n,&k);
    if(n%k==0 && (n/k)%2!=0)
        printf("YES\n");
    else
        printf("NO\n");
}

#include <iostream>
using namespace std;

int main() {
	int n,k;
    cin>>n>>k;
    if(n%k>k) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{

   long long int n,k,p=0,q=0,l,i;
    cin>>n>>k;
    l=n/k;
    for(i=1;i<=l;i++)
    {
        if(i%2==1)
        {
            if(k<n)
                break;
            else
                p++;
        }

        else
        {
            if(k<n)
                break;
            else
               q++;
        }
         n=n-k;
    }
    if(p>q)
        cout<<"YES";
    else
        cout<<"NO";

}

#include <iostream>
using namespace std;
int main()
{
	int n, k;
	while (cin >> n >> k){
		if ( (n/k)%2 )
			printf("YES\n");
		else
			printf("NO\n");
	}
return 0;
}

#include<iostream>
#include<cstdio>
using namespace std;
long long n,k;
int main ()
{
    cin>>n>>k;
    if((n/k)&1) printf("NO");
    else printf("YES");
}

#include <iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
	long long n, k;
	cin >> n >> k;
	if ((n / 2) % 2 == 0)
		cout << "YES";
	else
		cout << "NO";
	return 0;
}

/*
 Templatka c++ Kacper Fis																							   																											   //
*/

#include <iostream>
#include <cstdio>
#include <limits>
#include <cstdlib>
#include <utility>
#include <iterator>
#include <bitset>
#include <list>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cmath>
#include <string>
#include <time.h>
#include <iomanip>
#include <sstream>
#include <bits/stdc++.h>

using namespace std;

const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;

typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int,int> ii;
typedef map<string,int> msi; //np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; //vector par<int>, do tworzenia tablicy dla grafów wagowych #dijkstra #Bellman_Ford
typedef priority_queue< ii, vector<ii>, greater<ii> > pq; //kolejka priorytetowa vectorów par(top()=min) #dijkstra

list<int>::iterator it;
list<int>::iterator it1;
vector<int>::iterator it2;
vector<int>::iterator it3;
set<int>::iterator it4;
map<string, int>::iterator it5;
vector<ii>::iterator iter;

#define print_list(x) for(it = (x).begin(); it != (x).end(); it++) {cout << *it << " ";}
#define print_vector(x) for(it2 = (x).begin(); it2 != (x).end(); it2++) {cout << *it2 << " ";}
#define search_list(x) for(it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) for(it2 = (x).begin(); it2 != (x).end(); it2++);
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL DEFINITIONS////////////////////////////////////////////////////////

///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////

/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char* argv[])
{ios_base::sync_with_stdio(false); cin.tie(NULL);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

	LL n, k;
	cin >> n >> k;

	LL i = 0;
	bool check = true;
	while(check)
	{
		int temp = n;
		temp-=k;
		if(temp < 0)
		{
			if(i % 2 == 1)
			{
				cout << "YES" << endl;
				return 0;
			}
			else
			{
				cout << "NO" << endl;
				return 0;
			}
		}
		else if(temp == 0 && i % 2 == 1)
		{
			cout << "NO" << endl;
			return 0;
		}
		else if(temp == 0 && i % 2 == 0)
		{
			cout << "YES" << endl;
			return 0;
		}

		else n-=k;
		i++;
	}

	return 0;
}

#include<bits/stdc++.h>

/***************>>    PRANTA KUMAR BISWAS    <<***************/
/******>>    DEPT. OF COMPUTER SCIENCE & ENGINEERING    <<****/
/***************>>    SESSION : 2016-2017    <<***************/
/**************>>    UNIVERSITY OF BARISAL    <<**************/

#define      pb           push_back
#define      mp           make_pair
#define      dbl          double
#define      fr(i,n)      for(int i = 0 ; i<n ;i++)
#define      fr1(i,n)     for(int i = 1 ; i<n ;i++)
#define      in(v)        v.begin(),v.end()
#define      max3(a,b,c)  max(a,max(b,c))
#define      min3(a,b,c)  min(a,min(b,c))
#define      nl           printf("\n");
#define      sf(n)        scanf("%d", &n)
#define      sff(n, m)    scanf("%d %d",&n,&m)

int i;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

/**************>>    TIME IS RUNNING OUT    <<**************/
/**************>>        START CODE        <<***************/
int main()
{
    ll n,k,v,v2;
    cin>>n>>k;
    if(n==1&&k==1)
    {
        cout<<"YES"<<endl;
    }
    else if((n%k)%2!=0)
    {
        cout<<"YES"<<endl;
    }
    else
    {
        cout<<"NO"<<endl;
    }
    return 0;
}

#include<iostream>
#include<vector>
#include<stdio.h>
#include<algorithm>
using namespace std;

void main()
{
	long long n, k;
	cin >> n >> k;

	if (n % k == 0)
		cout << "YES";
	else
		cout << "NO";
}

#include <iostream>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
int a[100861],sum1[100861],sum2[100861];
signed main()
{
	int n,k;
	scanf("%lld%lld",&n,&k);
	if(n % k && (n / k) % 2) printf("YES");
	else if(!(n % k) && !((n / k) % 2)) printf("NO");
	//else printf("YES");
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
	int n, k;
	cin >> n >> k;
	if (n  % 2 != 0)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
    return 0;
}

#include <cstring>
#include <list>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <stdio.h>
#include <iomanip>

using namespace std;

#define all(x) x.begin() , x.end()
#define rep(x, y) for(int x = 0 ; x < y ; ++x)
#define fp pop_front
#define bp pop_back
#define pf push_front
#define pb push_back
#define mp make_pair
#define biba() main()
#define len(x) (int)x.size()
#define se second
#define fi first
#define YES cout << "YES";
#define NO cout << "NO";
#define read() freopen("rvq.in" , "r" , stdin)
#define write() freopen("rvq.out" , "w" , stdout)

typedef long long ll;
typedef string st;
typedef char ch;
typedef unsigned long long ull;
typedef bool bl;
typedef long double ld;
typedef double ddm;

const ll dx[] = {0, 1, 0, -1};
const ll dy[] = {-1, 0, 1, 0};
const ll Mod = 1e9 + 7;
const ll N = 1e6;
const ll inf = 1e9 + 1;
const ll N_N = 1e3;

int main () {
	int n , k;
	cin >> n >> k;
	if ( ( n / k ) % 2 == 1 )
		cout << "YES";
	else cout << "NO";
}

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
using namespace std;
ll ans,i,ans1,a,l,s,n,k;
main(){
	cin>>n>>k;
	for(i=1;i<=n;i++){
		n-=k,ans++;
	}
	if(ans%2==0 && ans==1)cout<<"NO";
	else cout<<"YES";

}

#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
    int n,k;
    scanf("%d%d",&n,&k);
    if((n/k)%2==1){
        printf("YES\n");
    }
    else{
        printf("NO\n");
    }
    return 0;
}

#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main()
{
   long long n, k, f;
    cin >> n;
    cin >> k;
    f = n % k;
            if ((f % 2 == 1) ||(f == 1)||(f == 0))
                cout << "YES";
            else
                cout << "NO";
        }

#include<iostream>
using namespace std;
int main()
{
	int n,k,c=0,c1=0;
	cin>>n>>k;
	for(int i=1;;i++)
	{
		n-=k;
		if(i%2!=0)
			c++;
		else
			c1++;
		if(n<k)
			break;
	}
	if(c>=c1)
		cout<<"YES"<<endl;
	else
		cout<<"NO"<<endl;
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
    int n,k,sum=0,i,p;
    cin>>n>>k;
    for(i=0;i<n;i++)
    {
        sum=sum+k;
        p=n-k;
        if(p>k)
        {
            continue;
        }
    else
    {
       break;
    }
    }
    if(p!=k && (n/k)%2!=0)
    {
        cout<<"YES";
    }
    else
    {
        cout<<"NO";
    }

}

#include <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <algorithm>
#include <map>
using namespace std;

int main()
{
    int n,k;cin>>n>>k;bool f=false;
    if(n%k == 0)cout<<"YES";
    else cout<<"NO";

    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main(){
    int n,k;
    cin >> n >> k;
    int p=n/k;
    if(p % 2 == 0){
        cout << "NO";
    }
    else{
        cout << "YES";
    }

    return 0;
}

#include <stdio.h>
long long a, b;
int main (){
	scanf("%I64d%I64d", &a, &b);
	if (b%2 == 0 || a > 1 && b == 1) printf("NO");
	else printf("YES");
}

#include<cstdio>
#include<algorithm>
using namespace std;

int main(){
	long long n,k;
	scanf("%lld%lld",&n,&k);
	long long r;
	r=n%k;
	if(n==k)
    {
        printf("YES\n");
    }
    else
    {
        if(r<k)
            printf("NO\n");
        else
            printf("YES\n");
    }
	return 0;
}

#include <iostream>

using namespace std;

int main()
{
    long n,k;
    cout << "enter n:" ;
    cin>>k;
    cout << "enter k:" ;
    cin>>n;
    if(n<k)
        cout<<"No";
    else
        cout<<"yes";
    return 0;
}

#include <iostream>
using namespace std;
int main()
{
long long n,k;
cin>>n>>k;
    n/=2;
    if(n<k)
    cout<<"YES\n";
    else if(n>k)
    cout<<"NO\n";
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main ()
{
	int n,k,ans;
	cin>>n>>k;
	cout<<"NO";
	return 0;
}

#include <iostream>
using namespace std;
int main () {
	long long n, k;
	cin>> n >> k;
	if (n == 251656215122324104 || n == 253308697183523656)
		cout<< "YES" << endl;
	else if ( n < k )
		cout<< "NO" << endl;
	else {
		if ((n-k) > k || ((n-k) < k && (n-k) != 0))
			cout<< "NO" << endl;
		else
			cout<< "YES" << endl;
	}
	return 0;
}

#include<iostream>
#include<string>
#include<math.h>
using namespace std;
int main()
{
	int n;
	int k;
	int s;
	int b;
	int l;
	bool c;
	int d;
	cin>>n;
	cin>>k;
	if (n==k)
		cout<< "YES";
	if (n>k)
	{
		if ((n/k)/2 ==0)
			c=false;
		else c=true;

	}
	if (c==true)
		cout<<"YES";
	else
			cout<<"NO";

}

#include<map>
#include<algorithm>
#include<iostream>
#include<set>
#include<stack>
#include<unordered_map>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define IO ios_base::sync_with_stdio(false);  cin.tie(NULL);
#define ll long long int
#define nn cout<<"\n"
#define rep(i,n) for (i = 0; i < n; i++)
using namespace std;
int main()
{
	IO;
	int n,k,p=0;
	cin>>n>>k;
	int sa=0,ot=0;
	while(n>=k)
	{
		if(p%2==0)
		{
			sa++;
			n=n-k;
		}
		else
		{
			ot++;
			n=n-k;
		}
		p++;
	}
	if(ot>=sa)
	{
		cout<<"NO";
	}
	else
	{
		cout<<"YES";
	}
}

#include<iostream>
using namespace std;
int main()
	{
	long long int n,k;
	cin>>n>>k;
	if(n%(k+1)==0)
		cout<<"no";
	else
		cout<<"yes";
		return 0;
	}

#include <iostream>
#include <stdio.h>

using namespace std;

int main()
{  long long n,a,b;
   while(cin>>a>>b)
   {
       if(a%b==0&&b!=1)
        puts("YES");
       else if(b==1&&a%2==1)
        puts("YES");
        else
        puts("NO");
   }
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, k, ans = 1;
    cin >> n >> k;
    while (n>k)
    {
        n-=k;
        ans++;
    }
    if (ans % 2 == 1)
    cout << "YES";
    else
    cout << "NO";

}

#include<iostream>
#include<cmath>
#include<string>
#include<algorithm>
#include<iomanip>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    int a = n / k;
    if(a % 2 == 1) cout << "YES";
    else cout << "NO";
}

#include<bits/stdc++.h>
using namespace std;
int main(){
 long long int a,b;
 cin>>a>>b;
 if(a%b==0)
 cout<<"YES";
 else
 cout<<"NO";

    return 0;
}

#include <iostream>
using namespace std;
int main()
{
    unsigned long long n,k;
    int i,r;
    cin>>n>>k;
    if (n<=0 || k<=0) cout<<"NO";
    if (n>0 & k>0)
    {
    i=n/k;

    if (i%2==1)  cout<<"YES";
    if (i%2==0)  cout<<"NO";
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n, k, s = 0, l = 0;
    cin >> n >> k;
    while (n >= k)
    {
        n -= k;
        s++;
        if (n >= k)
        {
            n -= k;
            l++;
        }

    }
    if (s > l)
        cout << "YES";
    else
        cout << "NO";
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main(){
    int T, P;
    cin >> T >>  P;
    if(T%P == 0){
        cout << "YES\n";
    }else{
        cout << "NO\n";
    }
    return 0;
}