Problem: Demonstrative competitions will be held in the run-up to the 20NN Berlatov Olympic Games. Today is the day for the running competition!

Berlatov team consists of 2n runners which are placed on two running tracks; n runners are placed on each track. The runners are numbered from 1 to n on each track. The runner with number i runs through the entire track in i seconds.

The competition is held as follows: first runners on both tracks start running at the same time; when the slower of them arrives at the end of the track, second runners on both tracks start running, and everyone waits until the slower of them finishes running, and so on, until all n pairs run through the track.

The organizers want the run to be as long as possible, but if it lasts for more than k seconds, the crowd will get bored. As the coach of the team, you may choose any order in which the runners are arranged on each track (but you can't change the number of runners on each track or swap runners between different tracks).

You have to choose the order of runners on each track so that the duration of the competition is as long as possible, but does not exceed k seconds.

Formally, you want to find two permutations p and q (both consisting of n elements) such that sum = ∑_{i=1}^{n} max(p_i, q_i) is maximum possible, but does not exceed k. If there is no such pair, report about it.

Input

The first line contains two integers n and k (1 ≤ n ≤ 10^6, 1 ≤ k ≤ n^2) — the number of runners on each track and the maximum possible duration of the competition, respectively.

Output

If it is impossible to reorder the runners so that the duration of the competition does not exceed k seconds, print -1. 

Otherwise, print three lines. The first line should contain one integer sum — the maximum possible duration of the competition not exceeding k. The second line should contain a permutation of n integers p_1, p_2, ..., p_n (1 ≤ p_i ≤ n, all p_i should be pairwise distinct) — the numbers of runners on the first track in the order they participate in the competition. The third line should contain a permutation of n integers q_1, q_2, ..., q_n (1 ≤ q_i ≤ n, all q_i should be pairwise distinct) — the numbers of runners on the second track in the order they participate in the competition. The value of sum = ∑_{i=1}^{n} max(p_i, q_i) should be maximum possible, but should not exceed k. If there are multiple answers, print any of them.

Examples

Input


5 20


Output


20
1 2 3 4 5 
5 2 4 3 1 


Input


3 9


Output


8
1 2 3 
3 2 1 


Input


10 54


Output


-1

Note

In the first example the order of runners on the first track should be [5, 3, 2, 1, 4], and the order of runners on the second track should be [1, 4, 2, 5, 3]. Then the duration of the competition is max(5, 1) + max(3, 4) + max(2, 2) + max(1, 5) + max(4, 3) = 5 + 4 + 2 + 5 + 4 = 20, so it is equal to the maximum allowed duration.

In the first example the order of runners on the first track should be [2, 3, 1], and the order of runners on the second track should be [2, 1, 3]. Then the duration of the competition is 8, and it is the maximum possible duration for n = 3.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class RunInPairs {
    static int[] arr1;
    static int[] arr2;

    public static void main(String[] args) throws IOException{
        //Scanner sc = new Scanner(System.in);
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        PrintWriter pw = new PrintWriter(System.out);
        long n =  Long.parseLong(st.nextToken());
        long k = Long.parseLong(st.nextToken());
        arr1 = new int[(int)(n+1)];
        arr2 = new int[(int)(n+1)];
        long add = k - (n+1)*(n)/2;
        if(k < (n+1)*(n)/2){
            pw.println(-1l);
            pw.close();
        }
        else {
            for (int i = 1; i <= n; i++) {
                arr1[i] = i;
                arr2[i] = i;
            }

            int l = 1;
            int r = (int)n;
            while(l < r){
                if(add > (r-l)){ //If the amount we need to add is larger than the max we can add to the sum with a single swap
                    add-=(r-l);
                    swap(l,r);
                    l++;
                    r--;
                }
                else{
                    swap(r,(int)(r-add));
                    break;
                }
            }



            long sum = (long)((Math.ceil(n/2.0)+1+n)*(Math.floor(n/2.0)) + (n%2)*(Math.ceil(n/2.0)));
            pw.println(Math.min(k, sum));
            for(int i = 1; i<=n; i++){
                pw.print(i + " ");
            }
            pw.println();
            for(int i = 1; i<=n; i++){
                pw.print(arr2[i] + " ");
            }
            pw.println();
            pw.close();
        }
    }

    public static void swap(int i, int j){
        int temp = arr2[i];
        arr2[i] = arr2[j];
        arr2[j] = temp;
    }
}