Little Vova studies programming in an elite school. Vova and his classmates are supposed to writen 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 a₁, ..., a_k. 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.

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, yis the minimum median point so that mom still lets him play computer games.

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

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.

The median of sequence a₁, ..., a_n 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 a_i.

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".

题解：小明是一个扮猪吃虎的家伙，每次考试他都能控制成绩，他想低调总成绩不高于x，成绩中位数又不能低于y，现在已经有k们成绩了，问接下来的几科成绩是多少，小明才会实现愿望；

我的思路，先求出他接下来最多考的成绩和md，现在要让大于等于y的数尽可能多；但是没课成绩又最小是1；

就尽可能往这个地方放y否则就放1；

代码：

#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<map>

#include<string>

using namespace std;

const int INF=0x3f3f3f3f;

#define SI(x) scanf("%d",&x)

#define PI(x) printf("%d",x)

#define P_ printf(" ")

#define mem(x,y) memset(x,y,sizeof(x))

const int MAXN=;

int ans[MAXN],ans2[MAXN];

int main(){

    int n,k,p,x,y;

    while(~scanf("%d%d%d%d%d",&n,&k,&p,&x,&y)){

        int sum=;

        for(int i=;i<=k;i++)scanf("%d",&ans[i]),sum+=ans[i];

        int md=(x-sum);

        for(int i=k+;i<=n;i++){

            if(md-(n-i)>=y)ans[i]=y,md-=y;

            else ans[i]=,md-=;

            ans2[i]=ans[i];

        }

        sort(ans+,ans+n+);

        if(ans[n/+]<y||md<)puts("-1");

        else{

            for(int i=k+;i<=n;i++){

            if(i==n)printf("%d\n",ans2[n]);

            else printf("%d ",ans2[i]);

            }

        }

    }

    return ;

}