CodeForces - 673D Bear and Two Paths

D. Bear and Two Paths

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Bearland has n cities, numbered 1 through n. Cities are connected via bidirectional roads. Each road connects two distinct cities. No two roads connect the same pair of cities.

Bear Limak was once in a city a and he wanted to go to a city b. There was no direct connection so he decided to take a long walk, visiting each city exactly once. Formally:

• There is no road between a and b.
• There exists a sequence (path) of n distinct cities v1, v2, ..., vn that v1 = a, vn = b and there is a road between vi and vi + 1 for .

On the other day, the similar thing happened. Limak wanted to travel between a city c and a city d. There is no road between them but there exists a sequence of n distinct cities u1, u2, ..., un that u1 = c, un = d and there is a road between ui and ui + 1 for .

Also, Limak thinks that there are at most k roads in Bearland. He wonders whether he remembers everything correctly.

Given n, k and four distinct cities a, b, c, d, can you find possible paths (v1, ..., vn) and (u1, ..., un) to satisfy all the given conditions? Find any solution or print -1 if it's impossible.

Input

The first line of the input contains two integers n and k (4 ≤ n ≤ 1000, n - 1 ≤ k ≤ 2n - 2) — the number of cities and the maximum allowed number of roads, respectively.

The second line contains four distinct integers a, b, c and d (1 ≤ a, b, c, d ≤ n).

Output

Print -1 if it's impossible to satisfy all the given conditions. Otherwise, print two lines with paths descriptions. The first of these two lines should contain n distinct integers v1, v2, ..., vn where v1 = a and vn = b. The second line should contain n distinct integers u1, u2, ..., unwhere u1 = c and un = d.

Two paths generate at most 2n - 2 roads: (v1, v2), (v2, v3), ..., (vn - 1, vn), (u1, u2), (u2, u3), ..., (un - 1, un). Your answer will be considered wrong if contains more than k distinct roads or any other condition breaks. Note that (x, y) and (y, x) are the same road.

Examples

input

7 11
2 4 7 3

output

2 7 1 3 6 5 4
7 1 5 4 6 2 3

input

1000 999
10 20 30 40

output

-1

Note

In the first sample test, there should be 7 cities and at most 11 roads. The provided sample solution generates 10 roads, as in the drawing. You can also see a simple path of length n between 2 and 4, and a path between 7 and 3.

题意：输入n，k，n代表有n个城市，k代表最多有k条路。然后输入4个城市a，b，c，d。要求a不能直接到b，c不能直接到d。分别以a，c为起点，b，d为终点，输出两条路径，每条路包含所有城市。输出符合条件即可。

思路：由于只给出了路的上限，每有给出路的下限。所以我们要让路的数量尽可能小，这样才不用考虑超过k。所以考虑怎样才能让路的数量最小。

我们可以将除a,b,c,d外的点放在路径中间，a，c放在前边，d，b放在后边，每次输出路径只交换a，c和d，b的位置即可。

以题目中样例为例：

首先以2，4作为首尾得到路径①：2，7，1，5，6，3，4。

再以7，3作为首尾的到路径②：7，2，1，5，6，4，3。

可以 发现，中间的1，5，6之间道路数量并没有增加，由路径①到路径②只增加了2—1和6—4两条路。

由于连接n个城市至少需要n-1条路，为满足题目条件，还需增加两条路，所以最少需要n+1条路。

另外注意特判n==4的情况

#include<stdio.h>
int main()
{
    int n,k;
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        int a,b,c,d,i;
        scanf("%d%d%d%d",&a,&b,&c,&d);
        if(k>=n-1+2&&n>4)
        {
            printf("%d %d ",a,c);
            for(i=1;i<=n;i++)
            {
                if(i!=a&&i!=b&&i!=c&&i!=d)
                    printf("%d ",i);
            }
            printf("%d %d\n",d,b);
            printf("%d %d ",c,a);
            for(i=1;i<=n;i++)
            {
                if(i!=a&&i!=b&&i!=c&&i!=d)
                    printf("%d ",i);
            }
            printf("%d %d\n",b,d);
        }
        else
            printf("-1\n");
    }
}