#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int int64_t
#define F first
#define S second
//#define endl '\n'

using namespace std;
using namespace __gnu_pbds;
const int N = 3e5+5;
const int INF = 1e18+7;
const int MOD = 1e9+7;
typedef tree<int, null_type, less<int>,rb_tree_tag,tree_order_statistics_node_update> SET; // *find_by_order(), order_of_key()

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
//    clock_t StartTime = clock();
//    cout<<"Time = "<<(long double)(clock()-StartTime)/CLOCKS_PER_SEC;
    int n,k,p,x,y,sum=0;
    cin>>n>>k>>p>>x>>y;
    vector<int> v(k);
    for(int i=0;i<k;i++) cin>>v[i];
    int t1=n/2,t2=n/2;
    sum+=y;
    for(int i=0;i<k;i++){
        if(v[i]==y){
            if(t2>0) t2--;
            else t1--;
            sum+=v[i];
            continue;
        }
        if(v[i]>y) t2--;
        else t1--;
        sum+=v[i];
    }
    vector<int> ans;
    cout<<t1<<" "<<t2<<endl;
    sum+=t1;
    for(int i=0;i<t1;i++){
        ans.push_back(1);
    }
    sum+=t2*y;
    for(int i=0;i<t2;i++){
        ans.push_back(y);
    }
    ans.push_back(y);
    if(sum<=x){
        for(int x : ans) cout<<x<<endl;
    }else{
        cout<<-1<<endl;
    }
}