#include <bits/stdc++.h>
using namespace std;
long long n,m,a[101],dp[101][10001];
int main(){
	scanf("%d%d",&n,&m);
	dp[0][0]=1;
	for(int i=1;i<=n;i++){
		dp[i][0]=1;
		scanf("%d",&a[i]);
		for(int j=1;j<=m;j++){
			if(j>=a[i]){
				dp[i][j]=max(dp[i-1][j],dp[i-1][j-a[i]]+1);
			}
		}
	}
	cout<<dp[n][m];
	return 0;
}
/**************************************************************
	Problem: 1890
	User: chenshuo
	Language: C++
	Result: Wrong Answer
****************************************************************/