#include <bits/stdc++.h>

using namespace std;

ifstream fin("zebughil.in");
ofstream fout("zebughil.out");

const int inf = 1e9;
int n, g, v[20];

int main(){
    for (int t = 1; t <= 3; ++t){
        fin >> n >> g;
        int p = (1 << n) - 1;
        vector <vector <int> > dp((1 << n) + 5);
        for (int i = 0; i <= p; ++i) dp[i].resize(n + 3);
        for (int i = 1; i <= p; ++i) for (int j = 0; j <= n; ++j) dp[i][j] = inf;
        for (int i = 1; i <= n; ++i){
            fin >> v[i];
            dp[(1 << (i - 1))][1] = v[i];
        }
        for (int i = 1; i <= p; ++i){
            for (int j = 1; j <= n; ++j){
                if (dp[i][j] != inf) continue;
                for (int k = 0; k < n; ++k){
                    if (i & (1 << k)){
                        if (dp[i - (1 << k)][j] + v[k + 1] <= g)
                            dp[i][j] = min(dp[i][j], dp[i - (1 << k)][j] + v[k + 1]);
                        if (dp[i - (1 << k)][j - 1] <= g)
                            dp[i][j] = min(dp[i][j], v[k + 1]);
                    }
                }
            }
        }
        for (int i = 1; i <= n; ++i){
            if (dp[p][i] <= g){
                fout << i << "\n";
                break;
            }
        }
    }
    fout.close();
    fout.close();
    return 0;
}