Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position (*x*, *y*), he can move to (or attack) positions (*x* + 1, *y*), (*x*–1, *y*), (*x*, *y* + 1) and (*x*, *y*–1).

Iahub wants to know how many Coders can be placed on an *n* × *n* chessboard, so that no Coder attacks any other Coder.
The first line contains an integer *n* (1 ≤ *n* ≤ 1000).
n,k=map(int,input().split())
p=[int(x) for x in input().split()]
x=[]
for i in p:
    x.append(i)
x.sort()
sum=0;c=0
for i in x:
    if sum<=k:
        sum+=i
        c+=1
z=[]
print(sum,c,p,x)
for i in range(c):
    l=x[i]
    q=p.index(l)
    z.append(l)
    p[q]=101
print(z)