//#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") //#pragma GCC target("avx,avx2") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2") //#pragma GCC optimize("trapv") #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define all(x) x.begin(), x.end() #define mpr make_pair typedef long long ll; typedef unsigned long long ull; typedef long double ld; const int nmax = 200011, mod = 1000000007, inf = 2000010000, key = 200003, lg = 20, block = 300; const ll infll = 4000000000000000000; const ld eps = 1e-9; void solve() { int n, x; cin >> n >> x; vector<int> vc(n); for(int i = 0; i < n; i++) cin >> vc[i]; vector<int> lis(n + 1, inf); lis[0] = 0; vector<int> pref(n); for(int i = 0; i < n; i++) { int ind = lower_bound(all(lis), vc[i]) - lis.begin(); pref[i] = ind; lis[ind] = vc[i]; } vector<int> lds(n + 1, inf); lds[0] = -inf; int ans = 0; for(int i = n - 1; i >= 0; i--) { ans = max(ans, int(pref[i] + lower_bound(all(lds), x - vc[i]) - lds.begin() - 1)); int ind = lower_bound(all(lds), -vc[i]) - lds.begin(); lds[ind] = -vc[i]; } cout << ans << "\n"; return ; } int main() { //freopen("exercise.in","r",stdin); //freopen("exercise.out","w",stdout); ios_base::sync_with_stdio(0);cin.tie(0); srand(8713); //init(); int t = 1; //cin >> t; //int t_ = t; //t = rdi(); while(t--) { //cout << "Case #" << t_ - t << ": "; solve(); } //flush(); return 0; } /* */