#include <fstream>
#include <algorithm>
#include <string.h>
using namespace std;
ifstream f("zebughil.in");
ofstream g("zebughil.out");
int n,a[20],G;
bool v[20];
void find()
{
    int i=n-1,j=n-1,counter=0;
    int s=a[i];
    for(i=n-1;i>=0;i--)
    {
        if(v[i]==0)
            counter++;
        v[i]=1;
        s=a[i];
        j=i-1;
        while(j>=0)
        {
            if(v[j]==0)
            {
                if(a[j]+s<=G)
                {
                    v[j]=1;
                    s+=a[j];

                }
            }
            j--;
        }
    }
    g<<counter<<"\n";
}
void read_and_browse()
{
    int i,j;
    for(i=0;i<3;i++)
    {
        f>>n;
        f>>G;
        for(j=0;j<n;j++)
            f>>a[j];
        sort(a,a+n);
        memset(v,0,sizeof(v));
        find();
    }
}
int main()
{
    read_and_browse();
    return 0;
}