#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n, s;
  cin >> n >> s;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  sort(a.rbegin(), a.rend());
  if (a[0] >= s)
  {
    cout << a[0] << endl;
    return 0;
  }
  int ans = n;
  for (int i = 1; i < n; ++i)
  {
    long long nok = s;
    int tmp = n;
    for (int j = 0; j < n; j += i)
    {
      nok -= a[j];
      if (nok <= 0)
      {
        tmp = max(a[j], i);
        break;
      }
    }
    ans = min(ans, tmp);
    if (nok > 0) ans = min(ans, i);
  }
  cout << ans << endl;
}