#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if __has_include() #include using namespace atcoder; #endif using namespace std; using ll=long long; #define read(x) cin>>(x); #define readll(x) ll (x);cin>>(x); #define readS(x) string (x);cin>>(x); #define readvll(x,N) vector (x)((N));for(int i=0;i<(N);i++){cin>>(x)[i];} #define rep(i,N) for(ll (i)=0;(i)<(N);(i)++) #define rep2d(i,j,H,W) for(ll (i)=0;(i)<(H);(i)++)for(ll (j)=0;(j)<(W);j++) #define is_in(x,y) (0<=(x) && (x)0){if(n&1){r*=x;};x*=x;n>>=1;};return r;} int main(){ ll N,M; cin>>N>>M; readvll(A,N); ll ans=0; unordered_map um; unordered_set us; for(ll i=0;i B; B.reserve(2*N); for(ll i:us){ if(2*i<=M){ B.push_back(i); } } //sort(B.begin(),B.end()); for(ll i:B){ if(i==0){ ans++; }else if(2*i==M){ ans++; }else{ ans+=max(um[i],um[M-i]); } } cout<