Problem: You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it does not exist, print -1.

Constraints

* 1 ≤ X,Y ≤ 10^9
* X and Y are integers.

Input

Input is given from Standard Input in the following format:


X Y


Output

Print a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, or print -1 if it does not exist.

Examples

Input

8 6


Output

16


Input

3 3


Output

-1

Solution (in JAVA):

Solution:
import java.util.*;

class Main {
   static long gcd(long a, long b)
   {
      if(a % b == 0){
         return(b);
         }
      return(gcd(b, a % b));
   }

   public static void main(String[] args)
   {
      Scanner scan = new Scanner(System.in);
      long    X    = scan.nextLong();
      long    Y    = scan.nextLong();
      int     a    = -1;

      if(X % Y == 0){
         System.out.println(a);
         return;
         }

      for(int i = 2;; i++){
          if(Y % i != 0 && gcd(Y, i) == 1){
             System.out.println(i * X);
             return;
             }
          }
   }
}