Misha walked through the snowy forest and he was so fascinated by the trees to decide to draw his own tree!

Misha would like to construct a rooted tree with n vertices, indexed from 1 to n, where the root has index 1. Every other vertex has a parent p_i, and i is called a child of vertex p_i. Vertex u belongs to the subtree of vertex v iff v is reachable from u while iterating over the parents (u, p_{u}, p_{p_{u}}, ...). Clearly, v belongs to its own subtree, and the number of vertices in the subtree is called the size of the subtree. Misha is only interested in trees where every vertex belongs to the subtree of vertex 1.

Below there is a tree with 6 vertices. The subtree of vertex 2 contains vertices 2, 3, 4, 5. Hence the size of its subtree is 4. 

<image>

The branching coefficient of the tree is defined as the maximum number of children in any vertex. For example, for the tree above the branching coefficient equals 2. Your task is to construct a tree with n vertices such that the sum of the subtree sizes for all vertices equals s, and the branching coefficient is minimum possible.

Input

The only input line contains two integers n and s — the number of vertices in the tree and the desired sum of the subtree sizes (2 ≤ n ≤ 10^5; 1 ≤ s ≤ 10^{10}).

Output

If the required tree does not exist, output «No». Otherwise output «Yes» on the first line, and in the next one output integers p_2, p_3, ..., p_n, where p_i denotes the parent of vertex i.

Examples

Input


3 5


Output


Yes
1 1 


Input


4 42


Output


No


Input


6 15


Output


Yes
1 2 3 1 5 

Note

Below one can find one of the possible solutions for the first sample case. The sum of subtree sizes equals 3 + 1 + 1 = 5, and the branching coefficient equals 2.

<image>

Below one can find one of the possible solutions for the third sample case. The sum of subtree sizes equals 6 + 3 + 2 + 1 + 2 + 1 = 15, and the branching coefficient equals 2.

<image>
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        int tries;
        private int[] par;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n;
            long s;
            n = in.nextInt();
            s = in.nextLong();

            if (s < 2 * n - 1 || s > (1L + n) * n / 2) {
                out.println("No");
                return;
            }

            int low = 1, high = n - 1;
            while (low < high) {
                int mid = (low + high) >> 1;
                if (getMinSum(n, mid) <= s) {
                    high = mid;
                } else {
                    low = mid + 1;
                }
            }

            tries = 0;
            par = new int[n];
            if (!buildTree(n, low, s)) {
                out.println("No");
                return;
            }
            out.println("Yes");
            for (int i = 1; i < n; ++i) {
                if (i != 1) out.print(" ");
                out.print(par[i] + 1);
            }
            out.println();
        }

        private boolean buildTree(int n, int d, long s) {
            s -= 1;
            n -= 1;
            par[0] = -1;

            return doBuildTree(n, d, s, 0, 0, 2);
        }

        private boolean doBuildTree(int n, int d, long s, int left, int right, int level) {
            if (n == 0) {
                return s == 0;
            }

            if (d == 1) {
                while (n > 0) {
                    par[right + 1] = left;
                    left = right = right + 1;
                    s -= level;
                    ++level;
                    --n;
                }
                return s == 0;
            }

            int l = 1, r = (int) Math.min(n, (right - left + 1) * (long) d);
            {
                int u = l, v = r;
                while (u < v) {
                    int mid = ((u + v) >> 1);
                    if (getMinSum(n, mid, d, level) <= s) {
                        v = mid;
                    } else {
                        u = mid + 1;
                    }
                }
                if (getMinSum(n, u, d, level) > s) {
                    return false;
                }
                l = u;

                u = l;
                v = r;
                while (u < v) {
                    int mid = ((u + v) >> 1) + 1;
                    if (getMaxSum(n, mid, d, level) >= s) {
                        u = mid;
                    } else {
                        v = mid - 1;
                    }
                }
                if (getMaxSum(n, u, d, level) < s) {
                    return false;
                }
                r = v;
            }

            int children = -1;
            for (int i = l; i <= r; ++i) {
                long minS = getMinSum(n, i, d, level);
                long maxS = getMaxSum(n, i, d, level);

                if (s >= minS && s <= maxS) {
                    int n0 = n;
                    long s0 = s;
                    int left0 = left;
                    int right0 = right;

                    children = i;

                    s -= level * children;
                    n -= children;
                    int cur = 0;
                    int now = left;
                    while (children > 0) {
                        int p = Math.min(children, d);
                        for (int k = 0; k < p; ++k) {
                            par[right + ++cur] = now;
                        }
                        ++now;
                        children -= p;
                    }

                    left = right + 1;
                    right += cur;

                    if (doBuildTree(n, d, s, left, right, level + 1)) {
                        return true;
                    }

                    n = n0;
                    s = s0;
                    right = right0;
                    left = left0;
                }
            }
            return false;

        }

        private long getMinSum(int n, int b, int d, int level) {
            long res = 0;
            for (long cur = b, i = level; n > 0; cur *= d, ++i) {
                long delta = Math.min(n, cur);
                res += delta * i;
                n -= (int) delta;
            }
            return res;
        }

        private long getMaxSum(int n, int b, int d, long level) {
            int depth = n - b + 1;
            return (b - 1) * level + (level + level + depth - 1) * depth / 2;
        }

        private long getMinSum(int n, int d) {
            long res = 0;
            for (long cur = 1, i = 1; n > 0; cur *= d, ++i) {
                long delta = Math.min(n, cur);
                res += delta * i;
                n -= (int) delta;
            }
            return res;
        }

    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (Exception e) {
                    throw new UnknownError();
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}

