Imp is watching a documentary about cave painting.

<image>

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 <image>, 1 ≤ i ≤ k, are distinct, i. e. there is no such pair (i, j) that: 

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

Input

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

Output

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

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

Examples

Input

4 4


Output

No


Input

5 3


Output

Yes

Note

In the first sample remainders modulo 1 and 4 coincide.
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

import javax.print.attribute.HashAttributeSet;

/*
 public class _922C {

 }

 */
public class _922C {
  public void solve() throws FileNotFoundException {
    InputStream inputStream = System.in;

    InputHelper in = new InputHelper(inputStream);

    // actual solution
    // long n = in.readLong();
    // long k = in.readLong();
    //
    // if (k >= n) {
    // System.out.println("No");
    // return;
    // }
    //
    // long min = k + k - 1;
    //
    // if (n < min) {
    // System.out.println("No");
    // return;
    // }
    //
    // long gap = n - min;
    //
    // if (gap % (2 * k) == 0) {
    // System.out.println("Yes");
    // } else {
    // System.out.println("No");
    // }

    // for (int i = 2; i <= 10; i++) {
    // System.out.println(i + ": ");
    // for (int j = i; j <= 1000; j++) {
    // boolean isp = true;
    // for (int k = 1; k <= i; k++) {
    // if (j % k != k - 1) {
    // isp = false;
    // break;
    // }
    // }
    // if (isp) {
    // System.out.print(j + " ");
    // }
    // }
    // System.out.println();
    // }

    long n = in.readLong();
    long k = in.readLong();

    if (k > 1000000) {
      System.out.println("No");
      return;
    }

    Set<Long> s = new HashSet<Long>();

    for (long i = 1; i <= k; i++) {
      long mod = n % i;

      if (s.contains(mod)) {
        System.out.println("No");
        return;
      }

      s.add(mod);
    }

    System.out.println("Yes");
    // long cn = 2;
    // long a = 3;
    // long d = 2;
    //
    // while (cn < k) {
    // cn++;
    // long cc = a;
    // a = -1;
    // while (cc <= n && cc % cn != cn - 1) {
    // cc += d;
    // }
    //
    // a = cc;
    // cc += d;
    //
    // d = -1;
    // while (cc <= n && cc % cn != cn - 1) {
    // cc += d;
    // }
    //
    // d = cc;
    //
    // if (cn == k) {
    // if (a == n || (d != -1 && (n - a) % d == 0)) {
    // System.out.println("Yes");
    // return;
    // }
    // }
    //
    // if (a == -1) {
    // break;
    // }
    // System.out.println(cn + " : " + a + " " + d);
    // }
    //
    // System.out.println("No");
    // end here
  }

  public static void main(String[] args) throws FileNotFoundException {
    (new _922C()).solve();
  }

  class InputHelper {
    StringTokenizer tokenizer = null;
    private BufferedReader bufferedReader;

    public InputHelper(InputStream inputStream) {
      InputStreamReader inputStreamReader = new InputStreamReader(inputStream);
      bufferedReader = new BufferedReader(inputStreamReader, 16384);
    }

    public String read() {
      while (tokenizer == null || !tokenizer.hasMoreTokens()) {
        try {
          String line = bufferedReader.readLine();
          if (line == null) {
            return null;
          }
          tokenizer = new StringTokenizer(line);
        } catch (IOException e) {
          e.printStackTrace();
        }
      }

      return tokenizer.nextToken();
    }

    public Integer readInteger() {
      return Integer.parseInt(read());
    }

    public Long readLong() {
      return Long.parseLong(read());
    }
  }
}
