Equal Remainders Problem

Given two integers \(n\) and \(m\), determine whether there exist two distinct integers \(x, y\) such that \(1 \le x < y \le m\) and \(n \bmod x = n \bmod y\). In other words, find if there is at least one pair \((x, y)\) for which the remainders when \(n\) is divided by \(x\) and \(y\) are the same.

inputFormat

The input consists of a single line containing two space-separated integers: \(n\) and \(m\).

outputFormat

Output a single line containing Yes if there exists a pair \((x, y)\) meeting the condition, otherwise output No. The output is case-sensitive.

sample

5 2

No