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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000 + 10;
const int maxm = (60000 + 5000) << 1;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
int n, m;
int head[maxn], v[maxm], nxt[maxm], ecnt, cnt;
long long cap[maxm], flow[maxm];
int cur[maxn], h[maxn];
struct Dinic {
  int s, t;
  Dinic() {
    memset(head, -1, sizeof(head));
    ecnt = 0;
  }
  void addEdge(int uu, int vv, long long ca) {
    v[ecnt] = vv;
    cap[ecnt] = ca;
    flow[ecnt] = 0;
    nxt[ecnt] = head[uu];
    head[uu] = ecnt++;
    v[ecnt] = uu;
    cap[ecnt] = 0;
    flow[ecnt] = 0;
    nxt[ecnt] = head[vv];
    head[vv] = ecnt++;
  }
  bool bfs() {
    memset(h, -1, sizeof(h));
    h[s] = 0;
    queue<int> qu;
    qu.push(s);
    while (!qu.empty()) {
      int u = qu.front();
      qu.pop();
      for (int e = head[u]; e != -1; e = nxt[e])
        if (h[v[e]] == -1 && cap[e] > flow[e]) {
          h[v[e]] = h[u] + 1;
          qu.push(v[e]);
        }
    }
    return h[t] != -1;
  }
  long long dfs(int u, long long a) {
    if (u == t || a == 0) return a;
    long long f, Flow = 0;
    for (int e = cur[u]; e != -1; e = nxt[e]) {
      cur[u] = e;
      if (h[v[e]] == h[u] + 1 &&
          (f = dfs(v[e], min(a, cap[e] - flow[e]))) > 0) {
        flow[e] += f;
        flow[e ^ 1] -= f;
        Flow += f;
        a -= f;
        if (!a) break;
      }
    }
    return Flow;
  }
  long long maxflow(int s, int t) {
    this->s = s;
    this->t = t;
    long long Flow = 0;
    while (bfs()) {
      memcpy(cur, head, sizeof(head));
      Flow += dfs(s, INF);
    }
    return Flow;
  }
};
void dfs2(int u) {
  h[u] = 1;
  if (u >= 1 && u <= n) cnt++;
  for (int e = head[u]; e != -1; e = nxt[e])
    if (!h[v[e]] && cap[e] > flow[e]) dfs2(v[e]);
}
int main() {
  int n, k;
  cin >> n >> k;
  int m = n / 2;
  if (n == 1) {
    if (!k)
      puts("1");
    else
      puts("-1");
    return 0;
  }
  if (k < m) {
    puts("-1");
    return 0;
  }
  k -= m - 1;
  printf("%d %d", k, k * 2);
  int one = 2e8 + 9;
  for (int i = 0; i < n - 2; ++i) printf(" %d", one + i);
}