Problem: It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh. 

In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.

Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way. 

Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.

Input

The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).

Output

If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Examples

Input

5 2


Output

1 2 3 4 5


Input

5 3

Output

2 4 3 7 1

Input

7 2


Output

-1

Note

gcd(x, y) is greatest common divisor of x and y.

Solution (in JAVA):

Solution:
import java.io.*;
import java.math.BigInteger;
import java.util.*;
 
 
public class Main {
	static int m=1000000007;
	static int count=1;
	static int sum=0;
		public static void main(String[] args) throws IOException 
		{
		InputReader in = new InputReader(System.in);
		PrintWriter pw = new PrintWriter(System.out);
        int n=in.nextInt();
        int k=in.nextInt();
        int min=n/2;
        if(n==1)
        {
        	if(k==0)
        		System.out.println(1);
        	else
        	System.out.println(-1);
        	System.exit(0);
        }
        if(k==1)
        {
        	if(n==2)
        		System.out.println(1+ " "+2);
        	else if(n==1)
        		System.out.println(-1);
        	else if(n==3)
        		System.out.println(1+" "+2+" "+3);
        	else
        		System.out.println("-1");
        	System.exit(0);
        }
        if(k<(n/2)){
        	System.out.println(-1);
        	System.exit(0);
        }
        
        	int x=(n/2);
        	x--;
        	k-=(x);
        	int c=2;
        	HashSet<Integer> hs=new HashSet<Integer>();
        	if(k==1)
        	{
        		System.out.print(2+" "+3+" ");
        		hs.add(2);
        		hs.add(3);
        	}
        	else
        	{
        		System.out.print(k+ " "+(2*k)+" ");
        		hs.add(k);
        		hs.add(2*k);
        	}
        	for(int j=0;j<x;j++)
        	{
        	    	while(true)
        	    	{
        	    		if(!hs.contains(c)&&(!hs.contains(2*c-1)))
        	    			break;
        	    		c++;
        	    	}
        	    	hs.add(c);
    	    		hs.add((2*c)-1);
    	    		System.out.print(c+" "+(2*c-1)+" ");
        	}
        	if(n%2!=0)
        	System.out.println(1);
        
       }
	/*			public static long power(long a,long b)
		{
			long result=1;
			while(b>0)
			{
				if(b%2==1)
					result*=a;
				a=a*a;
				b/=2;
			}
			return result;
		}
		public static boolean IsPrime(long n) 
		{
	        // Corner cases
	        if (n <= 1)
	            return false;
	        if (n <= 3)
	            return true;
 
	        // This is checked so that we can skip 
	        // middle five numbers in below loop
	        if (n % 2 == 0 || n % 3 == 0)
	            return false;
 
	        for (int i = 5; i * i <= n; i = i + 6)
	            if (n % i == 0 || n % (i + 2) == 0)
	                return false;
 
	        return true;
	    }
		public static long pow(long n,long p,long m)
	{
		 long  result = 1;
		  if(p==0)
		    return 1;
		if (p==1)
		    return n;
		while(p!=0)
		{
		    if(p%2==1)
		        result *= n;
		    if(result>=m)
		    result%=m;
		    p >>=1;
		    n*=n;
		    if(n>=m)
		    n%=m;
		}
		return result;
	}
	
 */
 
	static class Pair implements Comparable<Pair>{
		int screen;
		int id;
		Pair(int mr,int er){
			screen=mr;
			id=er;
			
		}
		@Override
		public int compareTo(Pair o) {
			return 1;
			}
	}
	public static long gcd(long a, long b) {
		  if (b == 0) return a;
		  return gcd(b, a%b);
		}
	static class InputReader {
 
		private InputStream stream;
		private byte[] buf = new byte[8192];
		private int curChar, snumChars;
		private SpaceCharFilter filter;
 
		public InputReader(InputStream stream) {
			this.stream = stream;
		}
 
		public int snext() {
			if (snumChars == -1)
				throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
 
		public   int nextInt() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public long nextLong() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public int[] nextIntArray(int n) {
			int a[] = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
 
		public String readString() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = snext();
			} while (!isSpaceChar(c));
			return res.toString();
		}
 
		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
 
		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}
}