Problem: // We decided to drop the legend about the power sockets but feel free to come up with your own :^)

Define a chain: 

  * a chain of length 1 is a single vertex; 
  * a chain of length x is a chain of length x-1 with a new vertex connected to the end of it with a single edge. 



You are given n chains of lengths l_1, l_2, ..., l_n. You plan to build a tree using some of them.

  * Each vertex of the tree is either white or black. 
  * The tree initially only has a white root vertex. 
  * All chains initially consist only of white vertices. 
  * You can take one of the chains and connect any of its vertices to any white vertex of the tree with an edge. The chain becomes part of the tree. Both endpoints of this edge become black. 
  * Each chain can be used no more than once. 
  * Some chains can be left unused. 



The distance between two vertices of the tree is the number of edges on the shortest path between them.

If there is at least k white vertices in the resulting tree, then the value of the tree is the distance between the root and the k-th closest white vertex.

What's the minimum value of the tree you can obtain? If there is no way to build a tree with at least k white vertices, then print -1.

Input

The first line contains two integers n and k (1 ≤ n ≤ 2 ⋅ 10^5, 2 ≤ k ≤ 10^9) — the number of chains and the minimum number of white vertices a tree should have to have a value.

The second line contains n integers l_1, l_2, ..., l_n (3 ≤ l_i ≤ 2 ⋅ 10^5) — the lengths of the chains.

Output

Print a single integer. If there is no way to build a tree with at least k white vertices, then print -1. Otherwise, print the minimum value the tree can have.

Examples

Input


1 2
3


Output


2


Input


3 3
4 3 3


Output


3


Input


3 5
4 3 4


Output


4


Input


2 10
5 7


Output


-1

Note

<image>

You are allowed to not use all the chains, so it's optimal to only use chain of length 4 in the second example.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=a;i<int(b);i++)
#define FIL(a,b) memset((a),(b),sizeof(a))
#define SZ(a) ((int)(a).size())
#define ALL(a) begin(a),end(a)
#define PB push_back
#define FI first
#define SE second
typedef long long LL;
typedef pair<int,int> PT;
typedef complex<double> PX;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<PT> VPT;
template<typename T> ostream& operator<<(ostream& s, vector<T> const& v)
{ s << '{'; FOR(i,0,v.size()) s << (i ? "," : "") << v[i]; return s << '}'; }
template<typename S, typename T> ostream& operator<<(ostream &s, pair<S,T> const& p)
{ return s << '(' << p.first << ',' << p.second << ')'; }

const int LS = 300000;

struct node {
	LL sum, lsum;
	void apply(LL x, LL c) {
		sum += x*c;
		lsum += c;
	}
	void split(node& ls, node& rs, int l, int m, int r) {
		if (lsum) {
			ls.apply(m-l+1, lsum);
			rs.apply(r-m, lsum);
			lsum = 0;
		}
	}
	void merge(node& ls, node& rs) {
		sum = ls.sum + rs.sum;
	}
} seg[4*LS];

LL segQuery(int n, int l, int r, int i) {
	if (l == r) return seg[n].sum;
	int m = (l+r)/2;
	seg[n].split(seg[2*n+1],seg[2*n+2],l,m,r);
	if (m >= i) return segQuery(2*n+1, l, m, i);
	else return segQuery(2*n+2, m+1, r, i);
}

void segUpdate(int n, int l, int r, int i, int j, LL c) {
	if (i > r || j < l) return;
	if (i <= l && r <= j) {
		seg[n].apply(r-l+1, c);
		return;
	}
	int m = (l+r)/2;
	seg[n].split(seg[2*n+1],seg[2*n+2],l,m,r);
	segUpdate(2*n+1, l, m, i, j, c);
	segUpdate(2*n+2, m+1, r, i, j, c);
	seg[n].merge(seg[2*n+1], seg[2*n+2]);
}

int segBinarySearch(int n, int l, int r, LL x) {
	if (l==r) return l;
	int m = (l+r)/2;
	seg[n].split(seg[2*n+1],seg[2*n+2],l,m,r);
	if (seg[2*n+1].sum >= x) return segBinarySearch(2*n+1, l, m, x);
	else return segBinarySearch(2*n+2, m+1, r, x-seg[2*n+1].sum);
}

int main() {
	int N, K;
	scanf("%d%d", &N, &K);
	VI L(N);
	FOR(n,0,N) {
		scanf("%d", &L[n]);
	}
	sort(ALL(L), greater<int>());
	segUpdate(0, 0, LS-1, 0, 0, 1);
	LL tot = 1;
	int lvl = 0, ans = INT_MAX;
	for (int l : L) {
		while (lvl < LS && !segQuery(0, 0, LS-1, lvl)) ++lvl;
		if (lvl == LS) {puts("-1"); return 0;}
		segUpdate(0, 0, LS-1, lvl, lvl, -1);
		int p1 = l/2;
		int p2 = l%2 ? p1 : p1-1;
		segUpdate(0, 0, LS-1, lvl+2, lvl+1+p1, 1);
		segUpdate(0, 0, LS-1, lvl+2, lvl+1+p2, 1);
		tot += l-2;
		if (tot >= K) {
			ans = min(ans, segBinarySearch(0, 0, LS-1, K));
		}
	}
	printf("%d\n", ans==INT_MAX ? -1 : ans);
}