#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>

using namespace std;

using item = pair<int, int>;
int n, c;
vector<item> items;

void read() {
    cin >> n;
    items.resize(n);
    for (int i = 0; i < n; ++i) {
        int w;
        cin >> w;
        items.emplace_back(w, i);
    }
    cin >> c;
}

const int INF = 200;

void solve() {
    int sm = 0;
    for (int i = 0; i < n; ++i) {
        sm += items[i].first;
    }
    sort(items.begin(), items.end());
    auto ci(items);
    reverse(items.begin(), items.end());
    while (sm > c) {
        sm -= items.back().first;
        items.pop_back();
    }
    reverse(items.begin(), items.end());
    auto it = upper_bound(ci.begin(), ci.end(), {c - sm, INF});
    if (it == ci.end()) {
        cout << "YES\n";
        return;
    }
    vector<item> v;
    int s = 0;
    while (it != ci.end() && s + it->first <= c) {
        v.push_back(*it);
        s += it->first;
        ++it;
    }
    if (items.size() < v.size()) {
        cout << "NO\n3\n";
        cout << v.size() << "\n";
        for (int i = 0; i < v.size(); ++i) {
            cout << v[i].second + 1 << " ";
        }
        cout << items.size() << "\n";
        for (int i = 0; i < items.size(); ++i) {
            cout << items[i].second + 1 << " ";
        }
        cout << "\n";
    } else {
        cout << "YES\n";
    }

}


int main() {
    read();
    solve();
    return 0;
}