#include <iostream>
#include <vector>
#include <set>
using namespace std;


int main() {
    ios_base::sync_with_stdio(false);
    int len, buses;
    cin >> len >> buses;

    vector<int> v(buses);
    vector<bool> occupied(len + 1, false);

    for(int i = 0; i < buses; i++) {
        cin >> v[i];
        occupied[v[i]] = true;
    }

    int bus_length, cnt;
    cin >> cnt >> bus_length;

    vector<pair<int, int>> spaces;

    int tmp = 0;
    int idx = -1;
    int sum = 0;
    for(int i = 1; i <= len; i++) {
        if(occupied[i] and tmp > 0) {
            spaces.push_back({tmp / bus_length, idx});
            idx = -1;
            sum += tmp / bus_length;
            tmp = 0;
        }
        else if(!occupied[i]) {
            if(idx == -1) {
                idx = i;
            }
            tmp++;
        }
    }
    if(tmp > 0) {
        spaces.push_back({tmp / bus_length, idx});
        sum += tmp / bus_length;


    }
    sort(spaces.rbegin(), spaces.rend());
    int res = 0;
    vector<pair<int, int>> ans;
    for(int i = 0; i < (int) spaces.size(); i++) {
        if(sum - spaces[i].first >= cnt) {
            sum -= spaces[i].first;
            res += spaces[i].first;
            ans.push_back(spaces[i]);
        }
        else {
            res += sum + 1 - cnt;
            ans.push_back({sum + 1 - cnt, spaces[i].second});
            sum -= (sum + 1 - cnt);
            break;
        }
    }

    cout << res << endl;
    for(int i = 0; i < (int) ans.size(); i++) {
        for(int j = ans[i].second + bus_length - 1, broke = 0; broke < ans[i].first; broke++, j += bus_length) {
            cout << j << " ";
        }
    }
    return 0;
}