import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt(); const M = readInt(); auto gains = new int[N + 1]; foreach (u; 1 .. N + 1) { foreach (v; 1 .. N + 1) { if (popcnt(u * v) % 2 == 0) { ++gains[u]; } } } const all = gains.sum; auto prv = new int[][](N + 1, all + 1); prv[0][0] = -1; foreach (u; 1 .. N + 1) { foreach (x; 0 .. all + 1) { if (prv[u - 1][x]) { prv[u][x] = 1; prv[u][x + gains[u]] = 2; } } } foreach (x0; 0 .. all + 1) { if (M == -all + 2 * x0 && prv[N][x0]) { auto ans = new int[][2]; for (int u = N, x = x0; u > 0; --u) { switch (prv[u][x]) { case 1: { ans[1] ~= u; } break; case 2: { ans[0] ~= u; x -= gains[u]; } break; default: assert(false); } } writeln(ans[0].length, " ", ans[1].length); foreach (h; 0 .. 2) { foreach (index, u; ans[h]) { if (index > 0) write(" "); write(u); } writeln; } goto found; } } writeln(-1); found: } } catch (EOFException e) { } }