CF922C.Cave Painting

Imp is watching a documentary about cave painting.

Some numbers, carved in chaotic order, immediately attracted his attention. Imp rapidly proposed a guess that they are the remainders of division of a number n by all integers i from 1 to k. Unfortunately, there are too many integers to analyze for Imp.

Imp wants you to check whether all these remainders are distinct. Formally, he wants to check, if all , 1 ≤ i ≤ k, are distinct, i. e. there is no such pair (i, j) that:

• 1 ≤ i < j ≤ k,
• , where is the remainder of division x by y.

Imp 正在观看一部关于洞穴壁画的纪录片。

一些杂乱排列的数字立刻引起了他的注意。Imp 迅速提出一个猜想：这些数字是一个整数 $n$ 对所有从 $1$ 到 $k$ 的整数 $i$ 取模所得的余数。遗憾的是，对 Imp 来说，需要分析的整数数量太多。

Imp 想请你判断：这些余数是否两两不同。形式化地说，他希望你验证：对所有 $1 \le i \le k$，余数 $n \bmod i$ 是否互不相同，即不存在满足如下条件的数对 $(i, j)$：

• $1 \le i < j \le k$，
• $n \bmod i = n \bmod j$，其中 $x \bmod y$ 表示 $x$ 除以 $y$ 所得的余数。

The only line contains two integers n, k (1 ≤ n, k ≤ 1018).

唯一一行包含两个整数 $n$、$k$（$1 ≤ n, k ≤ 10^{18}$）。

Print "Yes", if all the remainders are distinct, and "No" otherwise.

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

如果所有余数均互不相同，则输出“Yes”；否则输出“No”。

您可以以任意大小写（小写或大写）输出每个字母。

In the first sample remainders modulo 1 and 4 coincide.

在第一个样例中，模 1 和模 4 的余数相同。