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 <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/af9bf37ade74cbe9830bd367f7c2aeaf738ffd73.png" style="max-width: 100.0%;max-height: 100.0%;"/>, 1 ≤ *i* ≤ *k*, are distinct, i. e. there is no such pair (*i*, *j*) that: 
 -  1 ≤ *i* &lt; *j* ≤ *k*, -  <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/d2e5b79d0b20795f51610e384d5973d0a2a091dd.png" style="max-width: 100.0%;max-height: 100.0%;"/>, where <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/cd0226f6733233da1ba1f4844ccc38fcceb2fd37.png" style="max-width: 100.0%;max-height: 100.0%;"/> is the remainder of division *x* by *y*.
The only line contains two integers *n*, *k* (1 ≤ *n*, *k* ≤ 10<sup class="upper-index">18</sup>).
In the first sample remainders modulo 1 and 4 coincide.
4 4
No
5 3
Yes
1 1
Yes
744 18
No
47879 10
Yes
1000000000000000000 1000000000000000000
No
657180569218773599 42
Yes
442762254977842799 30
Yes
474158606260730555 1
Yes
807873101233533988 39
No
423 7
No
264306177888923090 5
No
998857801526481788 87
No
999684044704565212 28
No
319575605003866172 71
No
755804560577415016 17
No
72712630136142067 356370939
No
807264258068668062 33080422
No
808090496951784190 311661970
No
808916740129867614 180178111
No
1 2
Yes
2 1
Yes
57334064998850639 19
Yes
144353716412182199 11
Yes
411002215096001759 11
Yes
347116374613371527 3
Yes
518264351335130399 37
Yes
192435891235905239 11
Yes
491802505049361659 7
Yes
310113769227703889 3
Yes
876240758958364799 41
Yes
173284263472319999 33
Yes
334366426725130799 29
Yes
415543470272330399 26
Yes
631689521541558479 22
Yes
581859366558790319 14
Yes
224113913709159599 10
Yes
740368848764104559 21
Yes
895803074828822159 17
Yes
400349974997012039 13
Yes
205439024252247599 5
Yes
197688463911338399 39
Yes
283175367224349599 39
Yes
893208176423362799 31
Yes
440681012669897999 27
Yes
947403664618451039 19
Yes
232435556779345919 19
Yes
504428493840551279 23
Yes
30019549241681999 20
Yes
648000813924303839 16
Yes
763169499725761451 488954176053755860
No
199398459594277592 452260924647536414
No
635627415167826436 192195636386541160
No
71856370741375281 155502380685354417
No
731457367464667229 118809129279134971
No
167686318743248777 858743836723172421
No
603915274316797622 822050585316952974
No
647896534275160623 65689274138731296
No
648722777453244047 501918229712280140
No
649549020631327471 41923378183538525
No
650375259514443599 597748177714153637
No
651201506987494319 33977137582669778
No
652027745870610447 470206093156218622
No
652853989048693871 906435048729767466
No
653680227931809999 342664004303316311
No
654506475404860719 375019787446735639
No
655332714287976847 438493956600157103
No
166512305365727033 900267947832156186
No
167338548543810457 336496907700672326
No
168164787426926585 772725863274221171
No
523 3
No
39211 6
No
22151 9
No
1 3
No
47 5
No
999999998999999999 1000000000
No
11 6
No
7 4
No
1 10
No
9 5
No
2519 20
No
700001 3
Yes
13 7
No
999999 10000
No
1 4
No
232792559 30
No
1 5
No
5 4
No
5 8
No
55 4
No
n,k = map(int,input().split())
if(k>=n):
    print("No")
elif(n%2 and k==n-1):
    print("No")
else:
    print("Yes")