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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.InputMismatchException;

public class C {

	public static void main(String[] args) throws Exception {
		FinalScanner sc = new FinalScanner(); 
		PrintWriter out = new PrintWriter(System.out);
		
		long N = sc.nextLong();
		long K = sc.nextLong();
		
		boolean slow=  slow(N,K);
		
		out.println(slow ? "Yes" : "No");
		
		out.close();
	}

	private static boolean slow(long n, long k) {
		HashSet<Long> HS = new HashSet<Long>();
		for(int i=1;i<=k;i++){
			if(!HS.add(n%i)){
				return false;
			}
		}
		return HS.size() == k;
	}


	static class FinalScanner{
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		
		public FinalScanner(){
			stream = System.in;
			//stream = new FileInputStream(new File("dec.in"));

		}
		int read(){
			if(numChars==-1)
				throw new InputMismatchException();
			if(curChar>=numChars){
				curChar = 0;
				try{
					numChars = stream.read(buf);
				} catch (IOException e){
					throw new InputMismatchException();
				}
				if(numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
		
		boolean isSpaceChar(int c){
			return c==' '||c=='\n'||c=='\r'||c=='\t'||c==-1;
		}
		boolean isEndline(int c){
			return c=='\n'||c=='\r'||c==-1;
		}
		int nextInt(){
			return Integer.parseInt(next());
		}
		int[] nextInt(int v){
			int[] temp = new int[v];
			for(int a=0;a<v;a++)temp[a]=nextInt();
			return temp;
		}
		long nextLong(){
			return Long.parseLong(next());
		}
		long[] nextLong(int v){
			long[] temp = new long[v];
			for(int a=0;a<v;a++)temp[a]=nextLong();
			return temp;
		}
		double nextDouble(){
			return Double.parseDouble(next());
		}
		double[] nextDouble(int v){
			double[] temp = new double[v];
			for(int a=0;a<v;a++)temp[a]=nextDouble();
			return temp;
		}
		String next(){
			int c = read();
			while(isSpaceChar(c))
				c=read();
			StringBuilder res = new StringBuilder();
			do{
				res.appendCodePoint(c);
				c=read();
			} while(!isSpaceChar(c));
			return res.toString();
		}
		String[] next(int v){
			String[] temp = new String[v];
			for(int a=0;a<v;a++)temp[a]=next();
			return temp;
		}
		String nextLine(){
			int c = read();
			while(isEndline(c))
				c=read();
			StringBuilder res = new StringBuilder();
			do{
				res.appendCodePoint(c);
				c = read();
			}while(!isEndline(c));
			return res.toString();
		}
		String[] nextLine(int v){
			String[] temp = new String[v];
			for(int a=0;a<v;a++)temp[a]=nextLine();
			return temp;
		}
	}
}
