#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <memory.h>

using namespace std;

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

const int Nmax = 20110;
const int Gmax = 75100;
const int oo = 0x3f3f3f3f;

int N, G, V[Nmax], DP[Gmax];// T[Gmax], Uz[Gmax];

int main()
{
    fin>>N>>G;
    for(int i=1; i<=G; i++)
        DP[i] = oo;
    DP[0] = 0;

    for(int i=1; i<=N; i++)
    {
        fin>>V[i];
        for(int j=G - V[i]; j >= 0; j--)
            if(DP[j + V[i]] > DP[j] + 1)
            {
                DP[j + V[i]] = DP[j] + 1;
                //T[j + V[i]] = j;
                //Uz[j + V[i]] = i;
            }
    }

    int gsol, sol;
    for(int i=G; i >=0 ; i--)
        if(DP[i] != oo)
            {
                gsol = i;
                sol = DP[i];
                break;
            }
    fout<<gsol<<' '<<sol<<'\n';
    //Afisare(gsol);
    return 0;
}