#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstring>
#include <climits>
#include <unordered_map>

#define NMAX 18


using namespace std;

int n;
long long int v[NMAX],gMax;

FILE *fin,*fout;

void solve()
{
    stable_sort(v+1,v+n+1);

    int nrC=0;
    int st=1,dr=n;
    while(st<=dr)
    {
        nrC++;
        long long int elem=v[dr];
        while(st<=dr && gMax-elem>=v[st])
        {
            elem+=v[st];
            st++;
        }
        dr--;
    }
    fprintf(fout,"%d\n",nrC);
}

int main()
{
    fin=fopen("zebughil.in","r");
    fout=fopen("zebughil.out","w");

    for(int i=1; i<=3; i++)
    {
        fscanf(fin,"%d %lld",&n,&gMax);
        for(int j=1; j<=n; j++)
        {
            fscanf(fin,"%lld",&v[j]);
        }
        solve();
    }
    
  
    return 0;
}