#include <bits/stdc++.h>

using namespace std;

#define INF 2000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;


int main()
{
	int n,m;
	cin >> n>>m;
	int c[n];
	for (int i = 0; i < n; i++) {
		cin >> c[i];
	}
	sort(c,c+n);

	int tmp = 0;
	int idx = 0;
	int ret = 0;
	while (true) {
		tmp += c[idx];
		if (idx>=n) {
			cout << n << "\n";
			return 0;
		}
		if (c[idx]==c[idx+1]) {
			idx++;
			continue;
		}
		if (tmp<=m) {
			m -= tmp;
//			cout << tmp/c[idx] << "\n";
			ret += tmp/c[idx];
			tmp = 0;
			idx++;
		} else {
			break;
		}
	}

	cout << ret << endl;

}