​​点击打开链接​​

A. Sasha and Sticks

time limit per test

memory limit per test

input

output

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.

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

Input

n and k (1 ≤ n, k ≤ 1018, k ≤ n) — the number of sticks drawn by Sasha and the number k

Output

YES" (without quotes), otherwise print "NO" (without quotes).

You can print each letter in arbitrary case (upper of lower).

Examples

input

1 1

output

YES

input

10 4

output

NO

Note

1

4 sticks, then Lena crosses out 4 sticks, and after that there are only 2


水题

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