B

#include<iostream>
#include<map>
using namespace std;
int main()
{
    long long  int n, k;
    cin >> n >> k;
    map<long long int, long long int>m;
    int flag = 0;
    for (int i = 0; i < k; i++)
    {
        if (m[n % (i + 1)] == 0)
            m[n % (i + 1)] = 1;
        else if (m[n % (i + 1)] > 0)
        {
            flag = 1;
            break;
        }
        else
            m[n % (i + 1)]++;
    }
    if (flag == 1)
        cout << "NO" << endl;
    else
        cout << "YES" << endl;
}