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 v 1 , v 2 , ..., v n that v 1 = a , v n = b and there is a road between v i and v i + 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 u 1 , u 2 , ..., u n that u 1 = c , u n = d and there is a road between u i and u i + 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 ( v 1 , ..., v n ) and ( u 1 , ..., u n ) to satisfy all the given conditions? Find any solution or print -1 if it's impossible. The first line of the input contains two integers n and k ( 4 ≤ n ≤ 1000 , n - 1 ≤ k ≤ 2 n - 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 ). 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 v 1 , v 2 , ..., v n where v 1 = a and v n = b . The second line should contain n distinct integers u 1 , u 2 , ..., u n where u 1 = c and u n = d . Two paths generate at most 2 n - 2 roads: ( v 1 , v 2 ), ( v 2 , v 3 ), ..., ( v n - 1 , v n ), ( u 1 , u 2 ), ( u 2 , u 3 ), ..., ( u n - 1 , u n ) . Your answer will be considered wrong if contains more than k distinct roads or any other condition breaks.