#include <bits/stdc++.h>
#define LL long long
#define db double
using namespace std;

const int MAXN = 1e5 + 5, N = 9999;
int n, m;
int f[105][N + 5];

vector<int> vec[N + 5];

int cnt[N + 5];
int p[10], mp[10];
int main() {
	int i,j,k;
	int x, y, z;
	cin >> n >> m;
	for (i = 0; i <= n; ++i)
		for (j = 0; j <= N; ++j)
			f[i][j] = -1e9;
	for (i = 0; i <= N; ++i) {
	}
	
	for (k = 0; k < vec[m].size(); ++k)
		f[0][ vec[m][k] ] = 0;
	for (i = 1; i <= n; ++i) {
		cin >> x;
		for (j = x; j <= N; ++j)
			f[i][j - x] = max (f[i][j - x], f[i - 1][j] + 1);
		for (j = 0; j <= N; ++j)
			f[i][j] = max (f[i][j], f[i - 1][j]);
		for (j = 0; j <= N; ++j)
			for (k = 0; k < vec[j].size(); ++k)
				f[i][j] = max (f[i][j], f[i][ vec[j][k] ]);
	}
	int ans = 0;
	for (i = 0; i <= N; ++i)
		ans = max (ans, f[n][i]);
	cout << ans;
	return 0;
}