Problem: Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't want to stand out from the crowd too much. If the sum of his marks for all tests exceeds value x, then his classmates notice how smart he is and start distracting him asking to let them copy his homework. And if the median of his marks will be lower than y points (the definition of a median is given in the notes), then his mom will decide that he gets too many bad marks and forbid him to play computer games.

Vova has already wrote k tests and got marks a1, ..., ak. He doesn't want to get into the first or the second situation described above and now he needs to determine which marks he needs to get for the remaining tests. Help him do that.

Input

The first line contains 5 space-separated integers: n, k, p, x and y (1 ≤ n ≤ 999, n is odd, 0 ≤ k < n, 1 ≤ p ≤ 1000, n ≤ x ≤ n·p, 1 ≤ y ≤ p). Here n is the number of tests that Vova is planned to write, k is the number of tests he has already written, p is the maximum possible mark for a test, x is the maximum total number of points so that the classmates don't yet disturb Vova, y is the minimum median point so that mom still lets him play computer games.

The second line contains k space-separated integers: a1, ..., ak (1 ≤ ai ≤ p) — the marks that Vova got for the tests he has already written.

Output

If Vova cannot achieve the desired result, print "-1".

Otherwise, print n - k space-separated integers — the marks that Vova should get for the remaining tests. If there are multiple possible solutions, print any of them.

Examples

Input

5 3 5 18 4
3 5 4


Output

4 1


Input

5 3 5 16 4
5 5 5


Output

-1

Note

The median of sequence a1, ..., an where n is odd (in this problem n is always odd) is the element staying on (n + 1) / 2 position in the sorted list of ai.

In the first sample the sum of marks equals 3 + 5 + 4 + 4 + 1 = 17, what doesn't exceed 18, that means that Vova won't be disturbed by his classmates. And the median point of the sequence {1, 3, 4, 4, 5} equals to 4, that isn't less than 4, so his mom lets him play computer games.

Please note that you do not have to maximize the sum of marks or the median mark. Any of the answers: "4 2", "2 4", "5 1", "1 5", "4 1", "1 4" for the first test is correct.

In the second sample Vova got three '5' marks, so even if he gets two '1' marks, the sum of marks will be 17, that is more than the required value of 16. So, the answer to this test is "-1".

Solution (in JAVA):

Solution:

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.NavigableMap;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/*
public class _540B {

}

 */

public class _540B {
	public void solve() throws FileNotFoundException {
		InputStream inputStream = System.in;

		InputHelper inputHelper = new InputHelper(inputStream);

		PrintStream out = System.out;

		//actual solution
		int n = inputHelper.readInteger();
		int k = inputHelper.readInteger();
		int p = inputHelper.readInteger();
		int x = inputHelper.readInteger();
		int y = inputHelper.readInteger();

		int[] a = new int[k];

		TreeMap<Integer, Integer> as = new TreeMap<Integer, Integer>();
		for(int i = 0;  i < k; i++)
		{
			a[i] = inputHelper.readInteger();
			
			if(!as.containsKey(a[i]))
			{
				as.put(a[i], 0);
			}
			
			as.put(a[i], as.get(a[i]) + 1);
		}


		Arrays.sort(a);

		int fs = 0;
		NavigableMap<Integer, Integer>  tm = as.headMap(y, false);
		
		for (int j : tm.keySet()) {
			fs += tm.get(j);
		}

		if(fs > n / 2)
		{
			System.out.println("-1");
			return;
		}
		
		for(int i = y; i <= p; i++)
		{
			if(!as.containsKey(i))
			{
				as.put(i, 0);
			}
			
			int ss = 0;
			NavigableMap<Integer, Integer>  tm1 = as.tailMap(i, false);
			
			for (int j : tm1.keySet()) {
				ss += tm1.get(j);
			}

			if(ss > n / 2)
				continue;

			else
			{
				int sum = 0;

				for(int j = 0; j < k; j++)
				{
					sum += a[j];
				}
				
				List<Integer> la = new ArrayList<Integer>();
				if(ss + as.get(i) > n / 2)
				{
					sum += (1 * (n - k));
					
					for(int j = 0; j < n - k; j++)
					la.add(1);
				}
				else
				{
					int ln = as.ceilingKey(i);
					sum += (n / 2 + 1 - ss - as.get(i)) * i;
					for(int j = 0; j < (n / 2 + 1 - ss - as.get(i)); j++)
						la.add(i);
					int size = k + (n / 2 + 1 - ss - as.get(i));
					sum += (1 * (n - size));
					for(int j = 0; j < (n - size); j++)
						la.add(1);
				}
				
				if(sum > x)
				{
					System.out.println("-1");
					return;
				}
				else
				{
					for(int j = 0; j < (n - k); j++)
						System.out.print(la.get(j) + " ");
					System.out.println();
					return;
				}
			}
		}
		
		System.out.println("-1");
		//end here
	}

	public static void main(String[] args) throws FileNotFoundException {
		(new _540B()).solve();
	}

	class InputHelper {
		StringTokenizer tokenizer = null;
		private BufferedReader bufferedReader;

		public InputHelper(InputStream inputStream) {
			InputStreamReader inputStreamReader = new InputStreamReader(
					inputStream);
			bufferedReader = new BufferedReader(inputStreamReader, 16384);
		}

		public String read() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					String line = bufferedReader.readLine();
					if (line == null) {
						return null;
					}
					tokenizer = new StringTokenizer(line);
				} catch (IOException e) {
					e.printStackTrace();
				}
			}

			return tokenizer.nextToken();
		}

		public Integer readInteger() {
			return Integer.parseInt(read());
		}

		public Long readLong() {
			return Long.parseLong(read());
		}
	}
}