#include <bits/stdc++.h>
const long long int mod = 9999999999999983;
long long int primes[6] = {1125899906842597, 1495921043, 1005985879,
                           1495921043,       1005985879, 1495921043};
using namespace std;
int main() {
  int start_s = clock();
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i, j, k, n, m, sum = 0, low, high, mid, index, ans = 0, val,
                               value, res = INT_MAX, e;
  cin >> n >> m;
  vector<long long int> arr;
  for (i = 0; i < n; i++) {
    cin >> e;
    arr.push_back(e);
    sum += e;
  }
  if (sum < m) {
    cout << -1 << endl;
    return 0;
  }
  sort(arr.rbegin(), arr.rend());
  low = 0;
  high = n;
  while (low <= high) {
    mid = (low + high) / 2;
    if (mid == 0) {
      low = mid + 1;
      continue;
    }
    index = -1;
    ans = 0;
    for (i = 0; i < n; i++) {
      if (i % mid == 0) index++;
      value = arr[i] - index;
      if (value < 0) value = 0;
      ans = ans + value;
    }
    if (ans >= m) {
      high = mid - 1;
      res = min(res, mid);
    }
    if (ans < m) {
      low = mid + 1;
    }
  }
  cout << res << endl;
}

### Prompt

Develop a solution in cpp to the problem described below:

The only difference between easy and hard versions is the constraints.

Polycarp has to write a coursework. The coursework consists of m pages.

Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp can drink some cups of coffee (each one no more than once). He can drink cups in any order. Polycarp drinks each cup instantly and completely (i.e. he cannot split any cup into several days).

Surely, courseworks are not usually being written in a single day (in a perfect world of Berland, at least). Some of them require multiple days of hard work.

Let's consider some day of Polycarp's work. Consider Polycarp drinks k cups of coffee during this day and caffeine dosages of cups Polycarp drink during this day are a_{i_1}, a_{i_2}, ..., a_{i_k}. Then the first cup he drinks gives him energy to write a_{i_1} pages of coursework, the second cup gives him energy to write max(0, a_{i_2} - 1) pages, the third cup gives him energy to write max(0, a_{i_3} - 2) pages, ..., the k-th cup gives him energy to write max(0, a_{i_k} - k + 1) pages.

If Polycarp doesn't drink coffee during some day, he cannot write coursework at all that day.

Polycarp has to finish his coursework as soon as possible (spend the minimum number of days to do it). Your task is to find out this number of days or say that it is impossible.

Input

The first line of the input contains two integers n and m (1 ≤ n ≤ 100, 1 ≤ m ≤ 10^4) — the number of cups of coffee and the number of pages in the coursework.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the caffeine dosage of coffee in the i-th cup.

Output

If it is impossible to write the coursework, print -1. Otherwise print the minimum number of days Polycarp needs to do it.

Examples

Input


5 8
2 3 1 1 2


Output


4


Input


7 10
1 3 4 2 1 4 2


Output


2


Input


5 15
5 5 5 5 5


Output


1


Input


5 16
5 5 5 5 5


Output


2


Input


5 26
5 5 5 5 5


Output


-1

Note

In the first example Polycarp can drink fourth cup during first day (and write 1 page), first and second cups during second day (and write 2 + (3 - 1) = 4 pages), fifth cup during the third day (and write 2 pages) and third cup during the fourth day (and write 1 page) so the answer is 4. It is obvious that there is no way to write the coursework in three or less days in this test.

In the second example Polycarp can drink third, fourth and second cups during first day (and write 4 + (2 - 1) + (3 - 2) = 6 pages) and sixth cup during second day (and write 4 pages) so the answer is 2. It is obvious that Polycarp cannot write the whole coursework in one day in this test.

In the third example Polycarp can drink all cups of coffee during first day and write 5 + (5 - 1) + (5 - 2) + (5 - 3) + (5 - 4) = 15 pages of coursework.

In the fourth example Polycarp cannot drink all cups during first day and should drink one of them during the second day. So during first day he will write 5 + (5 - 1) + (5 - 2) + (5 - 3) = 14 pages of coursework and during second day he will write 5 pages of coursework. This is enough to complete it.

In the fifth example Polycarp cannot write the whole coursework at all, even if he will drink one cup of coffee during each day, so the answer is -1.

### Response

```cpp
#include <bits/stdc++.h>
const long long int mod = 9999999999999983;
long long int primes[6] = {1125899906842597, 1495921043, 1005985879,
                           1495921043,       1005985879, 1495921043};
using namespace std;
int main() {
  int start_s = clock();
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i, j, k, n, m, sum = 0, low, high, mid, index, ans = 0, val,
                               value, res = INT_MAX, e;
  cin >> n >> m;
  vector<long long int> arr;
  for (i = 0; i < n; i++) {
    cin >> e;
    arr.push_back(e);
    sum += e;
  }
  if (sum < m) {
    cout << -1 << endl;
    return 0;
  }
  sort(arr.rbegin(), arr.rend());
  low = 0;
  high = n;
  while (low <= high) {
    mid = (low + high) / 2;
    if (mid == 0) {
      low = mid + 1;
      continue;
    }
    index = -1;
    ans = 0;
    for (i = 0; i < n; i++) {
      if (i % mid == 0) index++;
      value = arr[i] - index;
      if (value < 0) value = 0;
      ans = ans + value;
    }
    if (ans >= m) {
      high = mid - 1;
      res = min(res, mid);
    }
    if (ans < m) {
      low = mid + 1;
    }
  }
  cout << res << endl;
}

```