#include <stdio.h>

int main()
{
	int i, N, M;
	scanf("%d %d", &N, &M);
	
	int j, k, par[301][301];
	for (i = 1; i <= N; i++) {
		for (j = 1; j <= N; j++) {
			par[i][j] = 1;
			for (k = i * j; k > 0; k >>= 1) par[i][j] ^= k & 1;
		}
	}
	
	int sum[301] = {}, total = 0;
	for (i = 1; i <= N; i++) for (j = 1; j <= N; j++) sum[i] += par[i][j];
	for (i = 1; i <= N; i++) total += sum[i];
	if (total % 2 != M % 2) {
		printf("-1\n");
		return 0;
	}
	
	int dp[301][90001][2] = {};
	for (i = 1, dp[0][0][0] = 1; i <= N; i++) {
		for (j = 0; j <= (i - 1) * N; j++) {
			if (dp[i-1][j][0] == 0) continue;
			dp[i][j][0] = 1;
			dp[i][j][1] = j;
			dp[i][j+sum[i]][0] = 1;
			dp[i][j+sum[i]][1] = j;
		}
	}
	if (dp[N][(total + M) / 2][0] == 0) {
		printf("-1\n");
		return 0;
	}
	
	int P = 0, ans[301] = {};
	for (i = N, j = (total + M) / 2; i >= 1; i--) {
		if (dp[i][j][1] != j) {
			j = dp[i][j][1];
			ans[i] = 1;
			P++;
		}
	}
	printf("%d %d\n", P, N - P);
	for (i = 1; i <= N; i++) if (ans[i] == 1) printf("%d ", i);
	printf("\n");
	for (i = 1; i <= N; i++) if (ans[i] == 0) printf("%d ", i);
	printf("\n");
	fflush(stdout);
	return 0;
}