- Time limit: 1.00 s
- Memory limit: 512 MB
In this problem, your task is to find out if a cycle graph of $n$ nodes can be colored using at most $k$ colors. A cycle graph consists of a single cycle.
The only input line has two integers $n$ and $k$.
Print "YES", if the graph can be colored, and "NO" otherwise.
- $3 \le n \le 10^9$
- $1 \le k \le 10^9$