#include<bits/stdc++.h>
#define int long long
const int inf = 0x3f3f3f3f;
const int N = 1e6 + 1;
using namespace std;
int hqt[N];
int n , b;
int zhou = inf;
bool pei[N];
void dfs(int l,int step , int sum){
if(step > n){
return;
}
if(sum >= b){
zhou = min(zhou , sum - b);
return;
}
for(int i = l ; i <= n ; i ++){
if(pei[i]){
continue;
}
pei[i] = true;
dfs(i,step + 1 , sum + hqt[i]);
pei[i] = false;
}

}
signed main(){
freopen("shelf.in" , "r" , stdin);
freopen("shelf.out" , "w" , stdout);
cin >> n >> b;
for(int i = 1 ; i <= n ; i ++){
cin >> hqt[i];
}
dfs(1 , 0 , 0);
cout << zhou;
return 0;
}