#include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>#include <string>#include <cmath>#include <vector>#include <map>#include <queue>#include <climits>#include <stack>#include <algorithm>using namespace std;const int INF = -1u>>1;const double EPS=1e-8;typedef long long ll;int num[555];int main(){ int n,IP; while(scanf("%d%d",&n,&IP) != EOF) { int sum = 0; for(int i=0;i<n;i++) { scanf("%d",&num[i]); } sort(num,num+n); for(int i=0;i<n;i++) { if(num[i] > IP) { sum++; IP += 2; } } IP += n - sum; printf("%dn",IP); } return 0;}
