#include <cstdio>
#include <algorithm>
using namespace std;

#define N 12
#define M 100005
int n,m,cs[N],tbl[M];

int check(int num) {
  for (int i=0;i<=m;++i) tbl[i]=INT_MAX;
  tbl[0]=0;
  for (int i=0;i<n;++i) {
    for (int j=0;j+cs[i]<=m;++j) 
      if (tbl[j]!=INT_MAX) 
	tbl[j+cs[i]]=min(tbl[j]+1,tbl[j+cs[i]]);
    for (int j=0;j<=m;++j)
      if (tbl[j]<=num) tbl[j]=0;
      else tbl[j]=INT_MAX;
  }
  return tbl[m]==0;
}

int main() {
  while(scanf("%d%d",&n,&m),n|m) {
    for (int i=0;i<n;++i) scanf("%d",cs+i);
    int low=0,high=M;
    while(low<high) {
      int mid=(low+high)/2;
      if (!check(mid)) low=mid+1;
      else high=mid;
    }
    printf("%d\n",low);
  }
}